a) Write a summary on Tower of Hanoi Problem. How can it be solved using recursion ? b) Amit goes to a grocery shop and purchases grocery for Rs. 23. He has 3 five rupee coins, 4 two rupee coins and 6 one rupee coins. In how many ways can he pay the shop keeper? Find a answer using generating functions.
c) Specify that a tree has at least 2 vertices of degree 1.