Algorithm

I need complete ans for this

20 20 20 25 100 5 Total 1. (15 points) Short problems. a. (e pts) (a) greedy algorithm Matrix chain multiplication has an efficient algorithm based on: (circle one) Integer multiplication has an efficient algorithm based on: (circle one) For a list of n numbers, finding the longest increasing subsequence using a top For a list of n numbers, finding the longest increasing subsequence using (b) divide and conquer (c) dynamic programming b. (2 pts) (a) greedy algorithm c. (2 pts) (b) divide and conquer (c) dynamic programming down approach has the running time: (circle one) (a) O(n) (b) O(n2) (c) Exponential in n d. (2 pts) dynamic programming as taught in class has the running time: (circle one) (a) O(n) (b) O(n2) (c) Exponential in rn e. (7pts) What is T(n) (in notation): T(n) = T(n-1) +2n-1 when n > 1 and T(1)1? Show your work