analysis of algorithms 23

Implement the Kruskal’s Algorithm for MST or the Dijstra’s algorithm for the shortest path. (If you could not write it in a programming language, you can just use your own word to explain the algorithm. There will be10% points deduction.)