1. In the lecture, we have seen the recursive solution to calculate the factorial of a number. Can you modify the logic a bit and calculate the power of a number raised to N (again, using recursion)? 2. The Tower of Hanoi is a mathematical puzzle. It consists of three poles and a number of disks of different sizes, which can slide onto any pole. The objective is to move all the disks from the first tower to the last tower in the same order, under the following constraints: a. Only one disk can be moved at a time. b. No larger disk may be placed on top of a smaller disk. For N=3 disks, following are the 7 moves for Tower of Hanoi: 3 Disk C A B A B C A B C A B C A B A B C