1) R.5.1 Describe a recursive algorithm for finding the maximum element in an array, A, of n elements. What is your running time and space usage? 2) R.5.3 Draw the recursion trace for the computation of power(2,5), using the traditional algorithm implemented in Code Fragment 5.8. 3) R.5.4 Draw the recursion trace for the computation of power(2,18), using the repeated squaring algorithm, as implemented in Code Fragment 5.9. 4) R.5.7 Describe a recursive algorithm for computing the nth Harmonic number, defined as: , = " 1/k. 5) R.5.8 Describe a recursive algorithm for converting a string of digits into the integer it represents. For example, '13531' represents the integer 13,531. 6) R.5.9 Develop a non-recursive implementation of the version of the power method from Code Fragment 5.9 that uses repeated squaring, with the same performance. 7) C.5.13 Give a recursive algorithm to compute the product of two positive integers, m and n, using only addition and subtraction. 8) C.5.20 Write a short recursive Java method that rearranges an array of integer values so that all the even values appear before all the odd values. Give its performance