Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [8057, 'J', 1729, 'f', 'R', 4611, 8553, 'f', 8381, 8257, 'Q', 'T', 'P', 'v', 'x', 'q', 9825, 'm', '9435', '8275', '4085', 'S', '3377', '7035', 'o', 'O', 'h', '5805', 'N', 'f', '9229', 'I', 'b', '3307', 'h', 'k', '6935', 'o', 's', 't'], ['X', 'm', 3289, '9435', '8275', '4085', 'S', '3377', '7035', 'o', 'O', 'h', '5805', 'N', 'f', '9229', 'I', 'b', '3307', 'h', 'k', '6935', 'o', 'P', 'P', 'u', 8905, 'b', 1773, 'n', 7229, 'g', 'p', 959, 6905, 'H', 'O', 'j', 9887]
Output:
9435, 8275, 4085, S, 3377, 7035, o, O, h, 5805, N, f, 9229, I, b, 3307, h, k, 6935, o