Build a Dynamic Programming algorithm in Python for thefollowing problem.
Given two sequences of vowels, find the length of longestsubsequence present in both of them.
NOTE: A subsequence is a sequence that appears in the sameorder, but not necessarily contiguous. For example, “aeiâ€, “aeoâ€,“eioâ€, “aiuâ€, ... are subsequences of “aeiouâ€.
Sample Input 1:
aeiou aiu
Sample Output 1:
3
Sample Input 2:
aeaiueoiuaeeoeooaauoi aeuioauuuoaeieeaueuiouaiieuiuuuaoueueauaeiauuo
Sample Output 2:
16
Sample Input 3:
iioioieiaiauaoeoiioiiue iuuueauiaieooaoaaouaaaae
Sample Output 3:
10
Sample Input 4:
iauuieeuuiieiuaeaioaieiaeeuouueaeiuiuuaiioaeuoueuiue oeeiauiiioaieoaouuuiueouauueeiauuiiuueeo
Sample Output 4:
26
Write a program, test using stdin → stdout
