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

7 weeks

step-by-step explanation:

convert each fraction to the least common multiple of 20, so 3/4 = 15/20 & 1/10 = 2/20, then divide 15 by 2 and you get a little over 7, so the food will last 7 weeks.

80π/3 or about 83.775

step-by-step explanation:

since a cone is 1/3 of a cylinder, we need to find the base's area. since area = πr^2, we get 16π. then, multiplying this by 5, we get 80π. dividing by 3, since the cone's volume is 1/3 of that of a cylinder's, we get 80π/3.

hope this !

b

step-by-step explanation:

throw the computer

step-by-step explanation: