1. Answer True or False and Justify your answer.
a. A directed graph exhibits strong connectivity if and only if, regardless of
the starting vertex, a Depth-First Search (DFS) will traverse every vertex
in the graph without requiring a restart.
b. If all edge weights in a graph are distinct, the shortest path between any
two vertices is unique.
2. The following is a directed graph G:
V= {a, b, c, d, e, f, g, h, i}
E= {(a, b), (a, d), (b, c), (c, a), (d, a), (e, d), (i, f), (f, g), (f, h), (g, h), (h, i)}
a. Draw the graph first.
b. Starting with node a traverse the graph for drawing a Depth First Search
(DFS) spanning tree.