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

Which approach to the theory-and-research cycle does the following sequence reflect: (1) specific observations suggest generalizations, (2) generalizations produce a tentative theory, (3) the theory is tested through the formation of hypotheses, and (4) hypotheses may provide suggestions for additional observations?

‼️‼️‼️10 points‼️‼️‼️ me it’s important‼️‼️‼️‼️‼️

Which of the following disjunctions is true? 4 + 4 = 16 or 6 - 5 = 11 4 · 3 = 7 or 3 - 2 = 5 8 - 5 = 13 or 7 · 2 = 12 7 - 4 = 11 or 6 + 3 = 9