Give pseudocode for a recursive algorithm to find the only pair of differing elements in (6 points) two sequences. You may assume that they have equal lengths, but differ by exactly one element. For example, given sequences (9, -64, 21,0) and (9,64, 16,0), your algorithm should return (21, 16). DIFFELEMENTS(A + (a1, Q2, ..., an), B+ (b1,b2, ..., bn)) Input: Output: State and prove a lemma in order to show the correctness of your algorithm. (8 points)