A mouse is moving through a maze and must make four turns where it can go either left or right. The mouse will escape the maze if it makes three lefts and one right, in any order.
(a) To the right, draw a tree diagram
of all possible routes the mouse
could take.

(b) Using your tree diagram, create
an organized list of the routes. For
example, a route of right, left, left,
right could be listed as RLLR.