Q2. [5 points] The Towers of Hanoi is a famous problem for studying recursion in computer science. We start with N discs of varying sizes on a stick (stacked in order according to size), and two empty sticks. We are allowed to move a disc from one stick to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost stick (see Figure).In this problem, we will formulate the Towers of Hanoi as a search problem.a) Propose a sta