QUESTION $5$

A single graph can have one spanning trees.

True

False

$0\mathrm{.}5$ points

QUESTION $6$

Minimum spanning tree :

a$.$ Covers a part of the vertices.

b$.$ Covers all the vertices.

c$.$ is unique.

$0\mathrm{.}5$ points

QUESTION $7$

Dijkstra Algorithm running time is :

a$.O(n**n)$

b$.O(2^n)$

:$.O(n)$

d$.O(n^2)$

$0\mathrm{.}5$ points

QUESTION $8$

Prim's algorithm running time is :

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

b$.O(n^3)$

:$.O(nlogn)$