A 1) Is the graph a complete graph? Explain your answer. 1 1 10 12 20 B 13 40 22 14 D 13 C 2) How many distinct Hamilton circuits are associated with this graph? 3) What Hamilton Circuit does the Nearest Neighbor Algorithm produce when you start at vertex A? What is the weight of that circuit? 4) Apply the Repetitive Nearest Algorithm to this graph to produce a Hamilton Circuit. 5) What is the resulting Hamilton Circuit produced by the Repetitive Nearest Neighbor Algorithm? 6) What is the weight of that circuit