1) What is the order in which the nodes of the undirected graph are discovered in a depth-first search starting from node A? When you have the choice of two or more nodes according to the DFS algorithm, break ties by choosing the node whose label comes first in the alphabet.

2) What is the order in which the nodes of the undirected graph are discovered in a breadth-first search starting from node A? When you have the choice of two or more nodes according to the BFS algorithm, break ties by choosing the node whose label comes first in the alphabet.

3) What is the order in which the nodes of the undirected graph are discovered in a lowest-cost-first search starting from node A? When you have the choice of two or more nodes according to the LCFS algorithm, break ties by choosing the node whose label comes first in the alphabet.

4) What is the size (in number of vertices) in the largest strongly connected component of the Directed Graph?

5) What is the order in which the nodes of the directed graph are discovered in a depth-first search starting from node A? When you have the choice of two or more nodes according to the DFS algorithm, break ties by choosing the node whose label comes first in the alphabet.

6) What is the order in which the nodes of the directed graph are discovered in a Breadth-first search starting from node A? When you have the choice of two or more nodes according to the BFS algorithm, break ties by choosing the node whose label comes first in the alphabet.

7) What is the order in which the nodes of the directed graph are discovered in a Lowest-cost-first search starting from node A? When you have the choice of two or more nodes according to the LCFS algorithm, break ties by choosing the node whose label comes first in the alphabet.

2 10 3 4 2 10 3 4