The minimum cost spanning tree found using KRUSKAL’S ALGORITHM for the following graph has a cost of _ Question 5 options:

a)

117

b)

122

c)

97

d)

119

yes. we do proportions in probabilities.

l.jnl.j/n.m,lm,

step-by-step explanation:

δabc ≅ δdcb by sas because

db ≅ ac . . given (side)

bc ≅ bc . . reflexive property (side)

∠dbc ≅ ∠ acb . . alternate interior angles where transversal bc crosses parallel lines bd and ac (included angle)