CHAPTER 9, GRAPH THEORY 140 Exercises for Section 9.4 For problems 1 6, determine a Hamiltonian cycle using a) the Nearest Neighbor Algorithm starting at at A the total b) the Cheapest Link Algorithm, writing the resulting cycle starting the final cycle and give In both cases, be sure to list the order of selection of the edges, draw weight