$17.$ Let T be a minimum spanning tree of the graph computed using Kruskal$$s algorithm. The order of edges selected by Kruskal$$s algorithm is

a$)($c$,$d$)($a$,$b$)($b$,$d$)($a$,$c$)$

b$)($c$,$d$)($a$,$b$)($b$,$d$)($b$,$e$)$

c$)($c$,$d$)($a$,$b$)($b$,$d$)($a$,$d$)$

d$)($c$,$d$)($a$,$b$)($b$,$d$)($b$,$c$)$

e$)$ None of the above

$18.$ Let T be a minimum spanning tree of the graph computed using Prim$$s algorithm. Assume

vertex a is selected first, then the order of vertices selected by Prim$$s algorithm is

a$)$ a$,$ b$,$ d$,$ e$,$ d

b$)$ a$,$ c$,$ d$,$ b$,$ e

c$)$ a$,$ d$,$ c$,$ e$,$ b

d$)$ a$,$ b$,$ d$,$ c$,$ e

e$)$ None of the above