Consider a forest with five trees and each tree contains at least two nodes. What is the minimum number of undirected edges needed to make the forest one connected tree?

The minimum number of edges is 5.

The minimum number of edges is 4.

The minimum number of edges is 8.

The minimum number of edges is 10.

Assume you have a directed connected graph of 10 nodes and 30 edges (no loops). If you present the graph as an adjacency list, then the total number of chained nodes is:

30

15

45

90

A FIFO queue, where it contains all gray nodes.

A FILO stack, where it contains all gray reachable nodes.

A FIFO queue, where it contains all white nodes.

A FIFO queue, where it contains all black nodes.

6

5

4

8