Consider the Towers of Hanoi problem with n=4. If you construct the associated goaltree following the same procedure explained in the slides, how many leaf nodes will be there? Consider the Towers of Hanoi problem with n=4 in the question above. Assume we replace the constraint of moving one disk at a time to moving two disks at a time. How many leaf nodes in the associated goal-tree? 3 2 6 12 Q18.3 1 Point Consider the Towers of Hanoi problem with n=3. For the recursive solution using the code shown in class, the number of times the BASIC STEP is executed is equal to