PART I $-$ Prim's MST algorithm using a Priority Queue

PART II $-$ Kruskal's MST algorithm using Union$-$Find data structure

PART III $-$ Dijkstra's algorithm Single Source Shertest Paths $=$ find the shartent

paths & to campute the liegeths of the sharken paths in weighled graph.

You should

provide Screenshots for showing compilation, poogrim raning of your compuler, ind

Iest your program foe the wtighod graphs in our Clas Noles: See Teting Graphs $1,2,3$ below.

Write a short repart in one page bo discus the line couplesities for your program in Big $O$

ausation.

Testing Graph $1$

Teating Grapl $2$

Teuting Graph $3$

You should

provide Sereen Shots for showing compilation, program running of your

computer, and test your program.

Write a short report in $1$ or $2$ page to discuss your implementation & results of

your program $($please show Couments for your Codes and justify your results, and

time complexities and discuss your design and implementations$).$