Question 8: Consider the following recursive algorithm, which takes as input a sequence (ai, a2,..., an) of length n, where n21: Algorithm MysteRY(a1, a2,... , an) ifn=1 then return the sequence (a) else (bi, b, . . . , bn-i ) = MYSTERY (a, a2. . . . , an-1); return the sequence (an, bi, b2,...,bn endif 4 Express the output of algorithm MYSTERY(a1, a2, , an) in terms of the input se- quence (ai, a2, . ,an). Prove that your answer correct