Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [7791, 1737, 'j', 'W', 7703, 'F', 'e', 6007, 'O', 'T', 6315, 8913, 'M', 'Q', 'r', '9659', '1817', 'K', 'A', 'X', '6195', 'M', '1395', 't', '7565', 'P', 'U', 'x', 8751, 2881, 'g', 1395], [25, 'q', 7399, 'A', 6203, 'Q', 'r', '9659', '1817', 'K', 'A', 'X', '6195', 'M', '1395', 't', '7565', 'P', 'd', 617, 'F', 4699, 'f', 1347, 9341, 'q', 'D', 7513, 'e', 8291, 'h']
Output:
Q, r, 9659, 1817, K, A, X, 6195, M, 1395, t, 7565, P