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'?

Group of answer choices

1

2

3

4

Match the vocabulary to the proper definition. in probability, two events in which 1. conditional probability the outcome of one event is independent of the outcome of a second event. 2. dependent events in probability, two events in which the outcome of one event is dependent on the outcome of a second event. the probability of an event in which the outcome of the event is conditional on the outcome of one or more different events. 3. independent events