draw a simple connected weighted undirected graph with 8 vertices and 16 edges, and with distinct weights. identify one vertex as a start and illustrate a running of dijkstra's algorithms