For the following problems stated as pseudo-code, let Ale...rl denote the sublist of the integer list A from the (-th to the r-th element, inclusive. Three (A[1... n]) If nsl Then Return // nothing to do InsertionSort (A[1... n]) Three(A1... 1511) Three (AIIT + 1 I ) Three(A[l21. n]) End Three (2 points) 1. State a recurrence that gives the complexity T(n) for algorithm Three (2 points) 2. Find the tight complexity of algorithm Three Two (Al1...n]) If nsl Then Return // nothing to do MergeSort( Two (A [1 1]) Two (AlL21..."]) End Two (2 points) 3. State a recurrence that gives the complexity T(n) for algorithm Two (4 points) 4. Find the tight complexity of algorithm Two