plz solve problem 5. show the work

Problem 4. (15 pts. Consider the selection algorithm numbers, Center were divide and Conger and groups of sor compute the median of 7 best 10. Derive the corresponding Its complexity with the appropriate constant the selection algorithm to find the lech smallest element of 7(2 +1) and Conquer and groups of seven numbers. Suppose to r elation and Problem 5. (15 pts. Use dynamie programming to find the optimal way to multiply AxBxCxD, where these matrices from left to right are respectively, 2x 3,3x5,5x4ad4x3 Problem 6. (15 p.) Consider ) + + . How many additions and multiplications are needed to compute pe for a given number e via the Horner's method? What is most efficient way to compute pe)? Problem T. (10 p.) Given the recursion 7(n) = ORI)? (n/2) + O(n), what should be so that (s) Problem 8. (10 pta) Use the tournament method applied to the array 17, 25, 30,14,9.38.16.77 to find the largest and second largest number. Show your work and count the number of comparisons. Problem 9. (True False) (20 pts.) (): Given a heap with elements, the smallest key can be found in little oh of operations (b): There are six posible heaps on the numbers 1,2,3,4,5. (c): The solution of the recursion T = 2 + 74.4n)+7(.5) is on for some constant c. (d): Worst case of binary search on an array of size 1023 is 11