Consider peg A with n even disk numbers(2,4,6...) and peg B with n odd disk numbers(1,3,5..)

Write a function named hanoi(2n,A,B,C) in C++ that prints how to move all 2n disks to peg C as described, with having the same rules as the original tower of hanoi (only one disk can move at a time and bigger disks cannot be placed on top of smaller one). Also calculate the number of movements required.

B) Write a recursive equation corresponding the number of moves in this custom hanoi function. Solving time complexity using replacment equations.

Figure-1: Ilustrating the input (a) and output (b) of SemiHanoi function