1. (10 pts) A grad student comes up with the following algorithm to sort an array A1..n that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array Dtakes as input an array of n numbers, A1..n] 1: function G-SORT(A, n) 2: G-sort-recurse(A, 1, n) 3: end function 4: function G-SORT-RECURSE(A, L, u) 5: if u - l