Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['j', 6649, 'l', 'k', 'F', '9369', 'e', 'w', 'h', 'z', '8517', 'l', 'S', 'C', 'w', 'k', 'C', 'C', 'o', 'Y', 'e', 'o', 'e', 'H', 'N', '1433', '447', '2105', '1443', 'G', 's', 'Q', 'o', 'G', 'L', 1657, 2067, 4677, 'z', 'E', 'Z'], [3393, 2811, 923, 1485, 3087, 4351, 'F', '9369', 'e', 'w', 'h', 'z', '8517', 'l', 'S', 'C', 'w', 'k', 'C', 'C', 'o', 'Y', 'e', 'o', 'e', 'H', 'N', '1433', '447', '2105', '1443', 'G', 's', 'Q', 'a', 6525, 8547, 9705, 9573, 3131, 5205, 'I', 'T', 2017, 'H', 7999, 4703]
Output:
F, 9369, e, w, h, z, 8517, l, S, C, w, k, C, C, o, Y, e, o, e, H, N, 1433, 447, 2105, 1443, G, s, Q