5. If vertices u and v are in different trees of the depth-first forest, then u and v must not be connected.

a. True

b. False

6.

A depth-first tree is always different from a breadth-first tree rooted at the same vertex for the same graph G.

a. True

b. False

7.

Using which one of the following data structures can we implement Dijkstra's shortest path algorithm on unweighted graphs so that it runs in linear time?

a. Binary Tree

b. Stack

c. Queue

d. Heap

8.

Given a directed graph with negative edge weights, Dijkstra's algorithm is capable of finding the shortest path between two nodes.

a. True

b. False