Consider the following recursive algorithm, which takes as input a sequence (a1, a2,, an) of length n, where n > 1: Algorithm MYSTERY (a1, a2,..., an): if n = 1 then return the sequence (a) else (b1, b2,..., bn-1) MYSTERY (a1, a2,..., an-1); = return the sequence (an, b1, b2,..., bn-1) endif 4 Express the output of algorithm MYSTERY (a1, a2,..., an) in terms of the input se quence (a1, a2,..., an). Prove that your answer correct. Act Go t