Python 3

Question 6 (1 point) Assume you are writing a program to solve a maze, and you want it to go all the way to a dead end then backtrack to the last junction, and try a different path until its end, then backtrack again to another junction and try again. In other words, you might find yourself looking at the following squares in this order: Start in A Move to B Move to C Move to D, found dead end, return back to C Move to E found dead end return back to C Nothing new to try at C return back to B Which data structure would best model this behavior? Set O Linked List O Queue O Map O Stack O Dynamic Array