For the next two problems use the following graph: 50 10 60 2 0 10 70 40 3 90 20 20 70 70 50 30 4 80 20 8 70 20 70 70 5 6 60 Starting at city 1, use the nearest neighbor (greedy) algorithm to develop a tour of each node. You do not have to go back to the start. Is this tour optimal? If it is not optimal, can you give a better tour to prove that? Use Kruskel's Algorithm to show the Minimum Spanning Tree of the previous graph