Google Tower of Hanoi. Solve the Tower of Hanoi problem by shifting all rings from one peg to another using a helper peg. The rings are initially arranged in ascending order, with the smallest ring on top. No larger ring can be placed on top of a smaller ring. a. Create a recursive function that prints the necessary steps to solve the Tower of Hanoi problem for a given number of discs. b. Develop a recursive function that returns the total number of steps required to solve the Tower of Hanoi problem for a given number of discs. Let T1 represent the source tower, T2 represent the destination tower, and T3 represent the auxiliary tower.