1) Write a recursive function hanoi that computes and returns the smallest number of steps to move the n stack, where n is the only function argument. The function prototype is given as: int hanoi (int); *

2) Write a complete C program to test the recursive hanoi function that you have written and upload the screenshot of the program output. Let n be 2. (Show the screenshot of output of the coding, and the screenshot of code in c program)

Please help with both question, wil give you good rate

The Towers of Hanoi is a mathematical puzzle whose solution illustrates recursion. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. 3. No larger disk may be placed on top of a smaller disk. The minimal number of moves required to solve a Tower of Hanoi puzzle can be expressed in the following mathematical form, hanoi(n) = 1 if n=1 hanoi(n) = 2 x hanoi(n-1) +1 if n>1 where n is the number of disks