part b please thank you
1. The network below shows the paths to success from L (log cabin) to W (White House). The first number is the cost of building a freeway along the edge and the second is the number of trees (in thousands) that would have to be cut down. e 8,4 8,5 8,4 i C 12,4 7,2 3, 1 5, 1 4, 4 6,3 8 3, 3 4, 2 1 4, 1 5, 1 7, 2 3, 2 L a d 4, 2 5,2 k 6,4 5, 3 8,3 8, 3 4,2 4, 1 5, 1 b W 7, 2 6,3 5, 5 m 6, 2 h (a) Use Kruskal’s algorithm to find a minimum-cost set of freeways connecting all the vertices together. Use Prim’s algorithm to find a set of connecting freeways that minimizes the number of trees cut down. (b)
