Please help with Question 9 and 10

5.4 Recursive Algorithms An algorithm is called recursive if it solves a problem by reducing it to an instance of the same problem with smaller input. In a recursive algorithm, we first declare the output for the base case (use an if statement), and if the input is not the basis case, we tell how to reduce the problem to the same problem with smaller input. Other than basic algebraic algorithms (factorials, powers, Euclidean algorithm, generating Fibonacci numbers), we've seen recursive algorithms used for searching (linear, binary) and sorting (merge sort). 7. Trace the Euclidean algorithm when it finds god(12, 17). That is, show all the steps used by Algorithm 3 to find god(12,17). ALGORITHM 3 A Recursive Algorithm for Computing ged(a, b). procedure god(a, b: nonnegative integers with a