a. Name two algorithms that solve the same problem with different time complexity. b. Determine the time complexitOf the following algorithm: (2 marks) Algorithm Ex3(A): Input: An array A storingn21 integers. Output: The sum of the prefix sums in A for i 0 to n-Ido for j 1 to i do returnS c. Order the following functions by asymptotic growth rate: n logn +2n 210 2logn 3n 100logn 4n 2" nnlogn uestion 3: a) (2.5 Marks) Sort the following array of integers using the insertion sort algorithm: A= (85, 24, 63, 45, 17, 31, 96, 50). b) (2 Marks) Count the number of comparisons and swaps that you may need to complete the task in (a) 07:02