Consider the reversal of a finite sequence of arbitrary elements. For example, given the sequence: (a1, a2, a3, a4, a5) …the reversal is (a5, a4, a3, a2, a1).(a) Give pseudocode for a recursive algorithm that reverses a sequence.(b) State a lemma that you would need to prove in order to show the correctness of your algorithm.(c) Prove that your algorithm is correct.