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 # Non-Recursive definition def fac1(n): f = 1 #Recursive definition O O O O O def fac2(n): 7 3 for i in range(n, 1, -1): f = f* i 5 return f 6 if n == 1: return 1 else: return n* fac2(n-1) #basis step # Recursive step