1. Examine the following algorithm and show the output values displayed when find(4) is executed. Show your work to justify the answer, especially the recursive steps. Algorithm find (n) { if (n : 0 or n == 1) { == return n } else { find(n - 1) + 2*find(n - 2) sum print sum // output the sum value return sum } }

Design and implement an algorithm using recursion and backtracking to sort an array of integers into ascending order. Consider the given array as input and produce a sorted array as output. Each time you take an integer from the input array, place it at the end of the output array. If the result is unsorted, backtrack.

Devise a recursive algorithm for finding n! mod m where n and m are positive integers.

Given below is a recursive algorithm to compute r". The input r can be any real number. The input n is assumed to be a non-negative integer. Exponent ( r, n) #Input: Real number r and a non-negative integer n. +Output: r If (n-0), return (1) p: Exponent ( ? ) Return ( rp) //The base case 7/The recursive call What missing input values should be used in the recursive call? O (r, n) O (r, n-1) O (r-1, n) O (r-1. n-1)