Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [2377, 'B', 'S', 'X', 'l', 7039, 2759, 'q', 'P', 'K', 8659, 477, 1831, 't', 'x', 'O', '6491', 'F', '479', '1587', '8095', 'P', '453', '9075', '9909', '2595', 'e', '7051', '7307', '8057', 'M', 'n', 'O', 'P', 'Q', 8437, 'v', 3887, 'Y'], [8809, 7975, 7327, 1275, 5045, 'E', 4437, 'Q', 1703, 'e', '6491', 'F', '479', '1587', '8095', 'P', '453', '9075', '9909', '2595', 'e', '7051', '7307', '8057', 'M', 'n', 'Z', 619, 757, 'e']
Output:
6491, F, 479, 1587, 8095, P, 453, 9075, 9909, 2595, e, 7051, 7307, 8057, M, n