Question

With clear example, you will need to do comparative time complexity to solve Minimum Spanning Tree using Greedy Algorithm of Prim and Kruskall with three different Data Structures

1. Weight Matrix  

2. Adjacency List

3. Adjacency List with Priority

Answer 1

_{​​​​​​}