Introduction to Greedy Approach||Minimum Spanning Tree (MST)||Kruskal's Algorithm ||Prim's Algorithm

At the end of this week, the students will be able to understand the concept of the greedy approach. The student will also learn how the minimum spanning tree works. Finally, the students will learn about Kruskal’s and Prim’s algorithms.