show how to modify dijkstra' algorithm to not only output the distance from to each vertex in gbut also to output tree rooted at such that the path in from to vertex is shortest path in from to - there are eight small islands in lakeand the state wants to build seven bridges to connect them so that each island can be reached from any other one via one or more bridges the cost of constructing bridge is proportional to its length the distances between pairs of islands are given in the following table