Maze program. In this assignment you will represent a maze with a binary tree. . The starting point is node N and the ending point is node Z. (The graph is binary search tree). The user or player of the game will be given a choice to turn left or right from the starting position. Trace the user's path through the tree and print out the nodes that they visit. If they get to a dead end, let them know. The user will have to start at the beginning again. If they get to the destination, they win. Count how many tries it takes them get to the destination.