Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['N', 4145, 6131, 2167, 2245, '7965', 'Z', '2363', '8011', '1599', '2513', 'x', '2769', 'F', 'Y', '3951', '1735', '5627', 'V', '9623', '3771', 'a', '8223', 'E', 'p', 'l', '8973', '4153', 'E', 5209, 'C', 'Y', 7957, 'D', 10011, 'F', 'u', 7139, 1955, 5283, 'F', 'O', 'A'], [6485, 6771, 'j', 'I', 'L', 'a', 'O', 'B', 2281, 'x', 'J', 2539, 6769, 9029, 'x', 'E', 1453, 9133, 'r', '7965', 'Z', '2363', '8011', '1599', '2513', 'x', '2769', 'F', 'Y', '3951', '1735', '5627', 'V', '9623', '3771', 'a', '8223', 'E', 'p', 'l', '8973', '4153', 'Y', 7165, 6207, 637, 'y', 'q', 'u']
Output:
7965, Z, 2363, 8011, 1599, 2513, x, 2769, F, Y, 3951, 1735, 5627, V, 9623, 3771, a, 8223, E, p, l, 8973, 4153