In [3]: * stacks # Start A=(5,3,7,4,9,2,8] B=[12,15] n=3 # Loop 1 for i in range(n): x=A.pop() B.append(x) print("After Loop 1") print("Stack A: %s " % str(A)) print("Stack B: %s " % str(B)) # Loop 2 for i in range(n): x=B.pop() A.append(x) print("After Loop 2") print("Stack A: %s " % str(A)) print("Stack B: %s " % str(B)) After Loop 1 Stack A: [5, 3, 7, 4] Stack B: [12, 15, 8, 2, 9] After Loop 2 Stack A: (5, 3, 7, 4, 9, 2, 8] Stack B: [12, 15] In [12]: #stacks # Start A=(5,3,7,4,9,2,8] B=(12,15] n-6 # Loop 1 for i in range(n): X-A.pop() B.append(x) print("After Loop 1") print("Stack A: %s " $ str(A)) print("Stack B: %s " $ str(B)) # Loop 2 for i in range(n): X-B.pop() A.append(x) print("After Loop 2") print("Stack A: %s " $ str(A)) print("Stack B: %s " % str(B)) After Loop 1 Stack A: [5] Stack B: [12, 15, 8, 2, 9, 4, 7, 3] After Loop 2 Stack A: [5, 3, 7, 4, 9, 2, 8] Stack B: [12, 15] 3. In the second program, how does changing the value of n change the output of the first loop? How is the order of the elements in stack A different than the order in stack B? 4. After both loops have executed in the second program, how have the two stacks changed? How does changing the value of n influence the output? Why does this happen