exercises draw the recursive call tree for the printrev(function from section when called with value of determine the worst case run time of the recursive factorial function determine the worst case run time of the recursive fibonacci function show or prove that the printlist(function requires linear time does the recursive implementation of the binary search algorithm from listing exhibit tail recursionif notwhy not determine the worst case run time of the recursive exponential function exp( determine the worst case run time of the backtracking solution for the -queens problem design and implement an iterative version of the factorial function design and implement recursive function for determining whether string is palindrome palindrome is string of characters that is the same as the string of characters in reverse design and implement recursive function for computing the greatest common divisor of two integer values design and implement program that prints pascal' triangle using recursive implementation of the binomial coefficients functiona(nrnr!( ) implement the nqueens board adt using the indicated data structure to represent the chess board ( - array ( - array