QUESTION $8$

Prim's algorithm running time is :

a$.O(n^{2}logn)$

b$.O(n^3)$

c$.O(nlogn)$

d$.O(n**n)$

$0\mathrm{.}5$ points

QUESTION $9$

Kruskal Algorithm running time is :

a$.$ edges, $n=$ nodes