Stacks and Queues Q4 (R15.25 and R15.26) - Read section 15.6.4 about using a stack to traverse a maze. Write out the order of letters encountered in the maze on page 714 of Big Java using a stack (R15.25) and a queue (R15.26) Exceptions Q5 (R11.8) Why don't you need to declare that your method might throw an IndexOutOfBounds exception? Q6 (R11.10) What happens if an exception does not have a matching catch clause? Algorithms Q7 (Chapter 5 problem 4 from the MSD textbook) Consider the following outline of a program See book for details). Assuming that n is the problem size, what would be the critical section of this program? Why