Answer and please explain this question from Algorithm Design and Analysis class. Thanks and will rate.

Question 1: Consider the Tower of Hanoi problem for the number of disks n 64. For a computer with processor speed 2 GHz, how long will it take to solve this problem? Question 2: Consider a Stack of n integers where n> 2. Using Push (item), Pop0, and Top O functions, call the sequence of functions to remove the third from the top item of below). Note that Top 0 returns the top item from the stack while Pop) removes the top item from the stack. Here is an example. Current Stack 12 14 10 23 17 12 14 23 17