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