Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['X', 4915, 'z', 'w', 'f', '9353', '1767', 'F', '9299', '3749', 'o', 't', '3591', 't', 'T', 'y', '4099', '3323', 'R', '8467', 'e', '5741', 'q', 'R', 6323, 'D', 2837, 'X'], [9041, 'I', 3989, 4221, 'H', 8399, 7325, 'c', 2373, 'h', 3211, 5647, 4455, 'G', 1755, 'f', '9353', '1767', 'F', '9299', '3749', 'o', 't', '3591', 't', 'T', 'y', '4099', '3323', 'R', '8467', 'e', '5741', 'K', 'I', 1299, 'R', 'X', 7947, 6043, 1653, 5693, 2639, 6305, 8571, 9427, 8629, 'N']
Output:
f, 9353, 1767, F, 9299, 3749, o, t, 3591, t, T, y, 4099, 3323, R, 8467, e, 5741