Referring to the maze problem at the end of the chapter, describe in words or pseudocode the algorithm being used to create the maze. 

?

Here is the piece in the textbook where it explains the maze problem: The generation of mazes is an example of the use of the union/find data structure. In Figure 8.25, the starting point is the top-left corner, and the ending point is the bottom-right corner. We can view the maze as a 50-by-88 rectangle of cells in which the top-left cell is connected to the bottom-right cell, and cells are separated from their neighboring cells via walls. A simple algorithm to generate the maze is to start with walls everywhere (except for the entrance and exit). We then continually choose a wall randomly, and knock it down if the cells that the wall separates are not already connected to each other. If we repeat this process until the starting and ending cells are connected, then we have a maze. It is actually better to continue knocking down walls until every cell is reachable from every other cell (this generates more false leads in the maze). EDIT Maze Generator figure 24.1 A 50 x SS maze How can we generate maze like this