I dont know the answer to this got confused

3. Find a Hamilton circuit in the graph below using the Cheapest Link Algorithm. Sketch the circuit on the vertices provided. Write the final answer in the space below so that it starts at E and then calculate the total weight 9 S) A 2 13 List the edges in the order that you chose them E BBc / E D A c, AD Total weight2_ 4. Consider the graph from #3 above a.) If the Brute Force Algorithm were used to find a Hamilton circuit, altogether how many different Hamilton circuits (including reversals) would have to be listed? b.)If the Repetitive Nearest Neighbor Algorithm were used to find a Hamilton circuit, altogether how many different Hamilton Circuits (including reversals) would have to be listed? 5. Which of the following always gives an optimal solution of the TSP (Traveling Salesman Problem)? Circle the letters of all that apply: a. Brute Force method b. Nearest Neighbor method c. Repetitive Nearest Neighbor method d. Cheapest Link