Aaw A E ALT A AaBbCcDdEe AaBbc dee AaBbCcD 1 Normal 1 No Spac... Heading 1 U Paragraph Styles You are planning a tour of the Hawaiian Islands. You will start and end your trip on the Big Island of Hawaii, and visit each of the other 5 islands. The distance between each of the islands (in miles) is shown in the table below. Hawaii Maui Lanai 100 35 Oahu 175 90 Molokai 120 40 30 90 Hawaii Maui Lanai Molokai Oahu Kauai Kauai 260 235 155 150 65 65 60 d) Solve the TSP using the Nearest-Neighbor-from-cach-City algorithm. e) What is the best route (include the path and the total distance) that you found using the above algorithms? f) Do you know if the route you stated in parte is the optimal route for this TSP? Explain. g) Suppose the state wants to build a communications network that connects all the islands Using the mileage amounts as a proxy for the costs involved, find the minimum cost spanning tree for this network (use Kruskal's algorithm). State the edges included and the total cost of the tree. o CL