nucch nuinber Fn Using a bottom-up (iterative) dynamic programming approach. You can use either Java or The Mergesort algorithm generates and solves subproblems according to the within Mergesort? Would it improve the running time? Explain your answer. pseudocode. c divide and conquer strategy. Could a dynamic programming approach be used Using either Java or pseudocode, write a recursive procedure Pow(x, N) to compute xN, where N is a positive integer. Use a divide and conquer strategy. Hint: d i for even N for odd N. XN -X(N-1)/2 x x(N-1) /2 x Write recurrence expressions for the running time T(N) of your Pow procedure in the following cases: ii) T(N) = T(N) for even N for odd N. The four parts carry, respectively, 20%, 45%, 15%, and 20% of the marks