Question 20:
Using the Breadth-First Search Algorithm,
which shows a correct minimum spanning
tree of the graph shown starting at vertex
'A'?

The answer is C

Step-by-step explanation:

option a, c,d are correct.

step-by-step explanation:

from the given figure, it is given that z is equidistant from the sides of the triangle rst, then from triangle tzb and triangle szb, we have

tz=sz(given)

bz=zb(common)

therefore, by rhs rule,δtzb ≅δszb

by cpctc, sz≅tz

also, from δctz and δasz,

tz=sz(given)

∠tcz=∠saz(90°)

by rhs rule, δctz ≅ δasz, therefore by cpctc, ∠ctz≅∠asz

also,from δasz and δzsb,

zs=sz(common)

∠zbs=∠saz=90°

by rhs rule, δasz ≅δzsb, therefore, by cpctc, ∠asz≅∠zsb

hence, option a, c,d are correct.

answer: just subtact the units and then add the non negative : happy to

step-by-step explanation: