Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [6617, 'n', 'n', 'v', 'L', 'v', 5501, 'J', 5341, 'H', 6671, 8125, 7881, 221, 15, 'e', 'c', 'R', 'Y', '8105', '435', 'V', 'W', '2407', '4039', 'L', '3363', '1557', '4305', '8715', '1587', 'X', 'V', '9403', 'W', '4745', '3895', 'e', '9897', '1873', 'N', 'W', 'S'], ['y', 3175, 7563, 'C', 5475, 6985, 'w', 4705, 'O', 'y', 'F', 5715, 1057, 'W', 7043, 't', 9393, 'K', '8105', '435', 'V', 'W', '2407', '4039', 'L', '3363', '1557', '4305', '8715', '1587', 'X', 'V', '9403', 'W', '4745', '3895', 'e', '9897', '1873', 'N', 'X', 'Y', 5697, 3649]
Output:
8105, 435, V, W, 2407, 4039, L, 3363, 1557, 4305, 8715, 1587, X, V, 9403, W, 4745, 3895, e, 9897, 1873, N