QUESTION #3

PROGRAMMING LANGUAGE C

You are now allowed to use the following in additional to the techniques of the previous chapters:

-function prototypes

-functions

-Full math.h library

-Random functions rand() and srand()

-Seed random number generator with and time()

-Recursion

\ D Homework 0 x / D Homework 0exD 0134066324 p file://C:/Users/Valeria%20Moctezuma/Downloads/Homework-06-Spring-2018.pdf \ D 01 340 6324.p \ e chegg Study x-ewAssignmen x e w Assignmen () HW7 SPR18 d - Homework-06-Spring-2018.pdf 213 Q3: (Recursive Exponentiation) (34 points) Write a recursive function power( base, exponent) that when invoked returns baseexponent For example, power( 3, 4) 3 3 * 3*3. Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship baseexponent base * baseexponent-1 and the terminating condition occurs when exponent is equal to 1 because base1 base Your program should prompt for the base and exponent. Q4: (Towers of Hanoi) (Bonus 10 points) Every budding computer scientist must grapple with certain classic problems, and the Towers of Hanoi (see picture) is one of the most famous of these. Legend has it that in a temple in the Far East, priests are attempting to move a stack of disks from one peg to another. The initial stack had 64 disks threaded onto one peg and arranged from bottom to top by decreasing size. The priests are attempting to move the stack from this peg to a second peg under the constraints that exactly one disk is moved at a time, and at no time may a larger disk be placed above a smaller disk. A third peg is available for temporarily holding the disks. Supposedly the world will end when the priests complete their task, so there's little incentive for us to facilitate their efforts O Type here to search 12:46 PM 3/4/2018