![void dijkstra (int n, const number WIllI, set of edges& F) index i, vnear; edge e; index touch [2.. n]; number length [2. .n]](https://media.cheggcdn.com/media%2F284%2F2841127c-0d59-45ce-94f5-c96b1c3943c8%2Fimage.png)
Use Kruskal’s algorithm (Algorithm 4.2) to find a minimum spanning tree for he graph in Exercise 2. Show the actions step by step. void dijkstra (int n, const number WIllI, set of edges& F) index i, vnear; edge e; index touch [2.. n]; number length [2. .n]; // For all
OR
OR