Objective Explore the properties of different algorithms Identify the big O classification Compare algorithms to identify efficiency Instructions Answer all questions below .Record them in the document under the title Towers of Hanoi Then compare the results of this to your other algorithm ldentify if this is more efficient or less efficient than the other algorithm you picked Towers of Hanoi Give the instructions for moving a tower of size three from one pole to another such that a larger disc is never above a smaller disk (label the small disc 1, medium disc 2, and largest of the three 3) You can experiment with the process at this Towers of Hanoi tool 1. 2. 3. 4. How many steps to move a tower of size 5? How many steps to move a tower of size 10? What is the Big O for Towers of Hanoi algorithm? Objective Explore the properties of different algorithms Identify the big O classification Compare algorithms to identify efficiency Instructions Answer all questions below Record them in the document under the title Binary Search Then compare the results of this to your other algorithm Identify if this is more efficient or less efficient than the other algorithm you picked Binary Search 1. Give the instructions for finding and unknown number in the tree 2. 3. 4. This is similar to the "guess the number game" available here How many steps to find a number 1 through 10 (worst case) How many steps to find a number 1 through 20 (worst case) What is the Big O for Binary Search