a) Suppose we are comparing two similar algorithms. Suppose that for all inputs of size n, the first algorithm run in 5n2 steps per second, while the second algorithm runs in 2" steps per seconds. For which values of n does the second algorithm run faster than the first algorithm? (2.0 marks) b) Is it true that 24" 0(8")? Justify your answer using asymptotic analysis. Answer without a proper explanation will have mark deducted. (2.0 marks) c) Given the following recursively implemented sorting algorithm, RecSort(int[] A, int n) which takes as input an unsorted array A of n integers and returns an array with the elements of the array A sorted in ascending order. The pseudocode of the RecSort(int[] A, int n) is as follow: RecSort(int [] A, int n) if n = 1 then Return A[0] m = A[0] index = 0 for i = 1 to n - 1 if A[i]