$2$ Problem $2$: Tower of Hanoi

For this problem, you will be implementing the missing portions of the program that calculates the minimum number of moves to solve the Tower of Hanoi problem for $n$ disks.

Tower of Hanoi involves three vertical rods and a set of varying sized disks, which can slide onto any rod. The disks are initially stacked on one of the rods in ascending order of size, with the largest disk on the bottom and the smallest on top, thus making a conical shape. The objective of this puzzle is to migrate the tower of disks completely to another rod, under the rule that only individual disks may be moved at once, and no disks may be placed on smaller disks.

You will be finishing a recursive implementation of the Tower of Hanoi minimal moves calculator program that follows the LC$-3300$ calling convention. Recursive functions always obtain a return address through the function call and return to the callee using the return address.

You must use the stack pointer $($ $$sp)$ and frame pointer $($$fp$)$ registers as described in the textbook and lecture slides.

Here is the $C$ code for the Tower of Hanoi minimal moves calculator you have been provided:

int ginimuntanoi$($int $n)\{$

if $)=(im$

return $1$;

else

return $(2.$ minimumHanoi $(n-1)$;

$\}$