Task:

You are to perform Worst$-$case time complexity analysis $($Big$-0)$ for the following algorithms:

$1.$ Prims $(4$ marks$).$

$2.$ Kruskal $(4$ marks$).$

$3.$ Dijkstra $(4$ marks$).$

$4.$ Breadth First Search $[$BFS$](4$ marks$).$

$5.$ Floyd Warshall $(4$ marks$).$

Instructions:

$1.$ Write only psuedo$-$code on the left side of the page, cost analysis on the right side of the page, and the final worst case time complexity at the bottom.