*Data Structures and Algorithm (C Programming) A strongly connected component (SCC) of a directed graph G(V,E) is a maximal set of vertices C⊆V...

A strongly connected component (SCC) of a directed graph G(V,E) is a maximal set of vertices C⊆V suchthatforeverypairofverticesuandvinC,wehavebothu↝vandv↝u;that is, vertices u and v are reachable from each other.
In the example graph given below, the sets of nodes a, b, e, c, d, f, g, and h each form a strongly connected component. Thus, the graph consists of 4 strongly connected components.

(a) Breadth First Search (BFS) can be used in determining whether each node in a given directed graph is reachable by every other node. Give the pseudocode of an algorithm using BFS that determines whether a given directed graph is a single SCC. Also provide the explanation of your algorithm in plain English along with a runtime analysis.

 (b) Depth First Search (DFS) can be used to calculate strongly connected compo- nents in a graph. Give the pseudocode of an algorithm using DFS that calculates SCCs in a given directed graph. Also provide the explanation of your algorithm in plain English along with a runtime analysis.