2) Gvve the 3) Apply the algorithm to tRe algorithm iterations. 4 Write a recursive version of the above selection sort and credit). ofthe functions satisfying f,-0(f)-O(f)-. . .-O(f10). 2 100n, n log3n, n!, vn, (1-n)(1-n, 105 2- (20%) Rank the following 10 functions by order of gro 3, (20%) Solve the following recurrence relations. For a I) Tn)9T(n/3) + n 2)T(n) = 9T(n/3) + n2 3) T(n) 9T(n/3)+n3 4) Tn) T(n-2) + n 4. (20%) Give a group of integer numbers stored in 20, 373. If we use the Quicksort method to sort them the first PARTITION (use "HoarePartition") 26 95 5. (20%) We have two input I iat 2) Gvve the 3) Apply the algorithm to tRe algorithm iterations. 4 Write a recursive version of the above selection sort and credit). ofthe functions satisfying f,-0(f)-O(f)-. . .-O(f10). 2 100n, n log3n, n!, vn, (1-n)(1-n, 105 2- (20%) Rank the following 10 functions by order of gro 3, (20%) Solve the following recurrence relations. For a I) Tn)9T(n/3) + n 2)T(n) = 9T(n/3) + n2 3) T(n) 9T(n/3)+n3 4) Tn) T(n-2) + n 4. (20%) Give a group of integer numbers stored in 20, 373. If we use the Quicksort method to sort them the first PARTITION (use "HoarePartition") 26 95 5. (20%) We have two input I iat