Question 5+ To see how bad the (greedy) Nearest Neighbour algorithm can be consider this deliberately pathological example: The complete graph Ki0 has vertices labelled 1,.,10 and each edge (a, b) is given weight (a -b)2. Do not attempt to draw this graph (a) Starting at the vertex determined by the last digit of your ANU ID (use vertex 10 if that digit is 0), apply the Nearest Neighbour algorithm to find a Hamilton circuit of supposedly low total weight. Give your answer as a list of vertices, and calculate the total weight (b) By avoiding large weights such as (10 )2, find (without the help of any algorithm) a Hamilton circuit of much lower total weight. Again give your answer as a list of vertices, and calculate the total weight (c) At the opposite extreme, find a Hamilton circuit of very high total weight, say more than 300 ?1:41 : Question 5+ To see how bad the (greedy) Nearest Neighbour algorithm can be consider this deliberately pathological example: The complete graph Ki0 has vertices labelled 1,.,10 and each edge (a, b) is given weight (a -b)2. Do not attempt to draw this graph (a) Starting at the vertex determined by the last digit of your ANU ID (use vertex 10 if that digit is 0), apply the Nearest Neighbour algorithm to find a Hamilton circuit of supposedly low total weight. Give your answer as a list of vertices, and calculate the total weight (b) By avoiding large weights such as (10 )2, find (without the help of any algorithm) a Hamilton circuit of much lower total weight. Again give your answer as a list of vertices, and calculate the total weight (c) At the opposite extreme, find a Hamilton circuit of very high total weight, say more than 300 ?1:41