Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [6007, 5933, 6485, 8637, 7973, 5297, 5097, 5123, 'Y', 'x', 8051, 'a', 'p', '911', '357', 'i', 'Q', '5963', '5389', 'P', '2609', 'J', 'O', 't', '8585', 't', '6715', '1791', '9407', '7675', 'I', '2449', '6075', '4053', '6235', '4939', 'y', 'i', 6071, 1975, 'e', 'h', 'w', 4583, 'q', 'y', 't', 'i', 'a', 'i', 'w', 9201, 'c', 'q', 1465], ['C', 'K', 3083, 'N', 8281, 'P', 5927, 'I', 8363, 'a', '911', '357', 'i', 'Q', '5963', '5389', 'P', '2609', 'J', 'O', 't', '8585', 't', '6715', '1791', '9407', '7675', 'I', '2449', '6075', '4053', '6235', '4939', 'v', 'L', 6061, 8895, 5403, 'V', 8801, 5211, 9677, 'F', 1383, 5897, 5037, 5111, 'n', 'A']
Output:
911, 357, i, Q, 5963, 5389, P, 2609, J, O, t, 8585, t, 6715, 1791, 9407, 7675, I, 2449, 6075, 4053, 6235, 4939