1. Which would you prefer to use, an algorithm requiring N5 steps or one requiring 2N steps?
2. Does the “maze” graph in Chapter 29 have a Hamilton cycle?
3. Draw the tree corresponding to Figure 44.4 when you are looking for a Hamilton cycle on the sample graph starting at vertex B instead of vertex A.