Create a spanning tree using the breadth-first search algorithm. Start at A (ie 0). What is the maximum number of edges needed to connect any other vertex to vertex 'A'?

A) 1

B) 2

C) 3

D) 4

< coa = 150 ( given)

as ba and bc are tangents

so oc and oa is perpendicular to cb and ab respectively because in circle normal passes through centre

so in quadrilateral oabc

< coa + < oab + < ocb + < abc = 360

150 +90+90 + < abc = 360

330 + < abc = 360

< abc = 360 -330 = 30

so < abc = 30

⭐dhruv⭐

i think the answer is b x = 1, y = 35/2

the answer to this in exact form is 4/35 but in decimal form its 0.1142857

hope this if needed hmu