find which bridges to build to minimize the total construction cost - draw simpleconnectedundirectedweighted graph with vertices and edgeseach with unique edge weights illustrate the execution of kruskal' algorithm on this graph (note that there is only one minimum spanning tree for this graph - repeat the previous problem for the prim-jarnik algorithm - consider the unsorted sequence implementation of the priority queue used in dijkstra' algorithm in this casewhy is this the best-case running time of dijkstra' algorithm ( on an -vertex graphr- describe the meaning of the graphical conventions used in figure illustrating dfs traversal what do the colors blue and black refer towhat do the arrows signifyhow about thick lines and dashed linesr- repeat exercise - for figure illustrating bfs traversal - repeat exercise - for figure illustrating directed dfs traversal - repeat exercise - for figure illustrating the floyd-warshall algorithm -