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. turk and mcalister

b. howard, mission, and market

c. yes. since streets end some do not cross yet are not parallel to others. example: mcalister and 5th

step-by-step explanation:

parallel lines are lines which do not intersect ever and look a lot like railroad tracks. turk, mcalister and golden gate are examples of these.

intersect are streets which cross each other and a car on one can reach the other. howard, mission, and market intersect with 6th.

skew lines are lines which neither intersect nor are parallel. these lines exist here because some streets end and never intersect another like mcalister and 5th.

see attached

step-by-step explanation:

given the function as;

write the equation replacing f(x) with y

form   and fill a table containing values of y with corresponding values of x

you can take a range for   values of x as -3≤x≤3

solving for x=-3

for x=-2

repeat the same procedure to get the values of y for the remaining ,x=-1 to x=3

plot the values of y against values   of x and obtain the following graph