A B While constructing the above minimum spanning tree, the edges were added in the following sequence: 1. A-E 2. C-D 3. E-B 4. E-C Which one of the following algorithms discussed in the lectures was used to construct the above minimum spanning tree? O a Dijkstra's Algorithm O b. Depth First Algorithm c Prim's Algorithm O d. Kruskal's Algorithm