Please take time to answer the questions correctly and accurately. And show clear workings and proper steps.

Whenever you are designing an algorithm you must address the three questions we are typically posing (correctness, complexity and improvement potential). The faster your algorithm, the better your mark. Assignment 1 Question 1: Consider the following algorithm // L is a list and n is its length// // For the purpose of this assignment we assume that n= 4**k, for k21// Alg1 (L,n) remove the smallest and largest element from L fn-2> (4"k)/2 call Alg1 (L, n-2) a) What is the algorithm intended to do? b) Is it correct? If it is not correct discover the error(s) when trying to prove c) d) correctness and fix it (them). Then, reprove the correctness. What is its time complexity? Can it be improved? You may use any algorithm discussed in class