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

If the endpoints of the diameter of a circle are (8, 6) and (2,0), what is the standard form equation of the circle? a) (x + 5)2 + (y + 3)2 = 18 (x + 5)2 + (y + 3)2 = 3.72 (x - 5)2 + (y - 3)2 = 18 d) (x - 5)2 + (y - 3)2 = 32

State if it is acute obtuse or right

Problems and applications q5 four roommates are planning to spend the weekend in their dorm room watching old movies, and they are debating how many to watch. here is their willingness to pay for each film: willingness to pay (dollars) shen antonio dmitri jake first film 10 9 8 3 second film 8 7 6 2 third film 6 5 4 1 fourth film 4 3 2 0 fifth film 2 1 0 0 within the dorm room, the showing of a movie a public good. if it costs $12 to rent a movie, the roommates should rent movies in order to maximize the total surplus. suppose the roommates choose to rent the optimal number of movies you just indicated and then split the cost of renting equally. this means that each roommate will pay $ .