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

(08.01)consider the following pair of equations: x + y = −2 y = 2x + 10 if the two equations are graphed, at what point do the lines representing the two equations intersect? (−4, 2) (4, 2) (−2, 4) (2, 4)

Will mark ! (10 points also! ) if x varies inversely with y and x =6 when equals y= 10, find y when x=8 a. y=4.8 b. y=7.5 c. y=40/3 d. y=4/15

Dylan is evaluation the expression 13+19+7+10 at one step in his work, dylan rewrites the equation as 13+7+19+10 which property of addition must dylan have used when he evaluated the expression?