Consider the directed acyclic graph below.

$($a$)$ Is this graph strongly connected? Is it weakly connected? Justify your answers.

$($b$)$ Explain how a graph traversal would confirm your answers in $($a$).$

$($c$)$ Suppose that an edge from node $x$ to node $Y$ indicates that $x$ is dependent on $Y,$ i$.$e$.$ that $Y$ is

task that needs to be completed before $x$ can be completed. In the example below S$1$ S$6$

means that $S6$ must be completed before S$1.$ Perform a depth$-$first traversal of this graph, in

order to produce a topological sort of the vertices of the graph. $($Recall that depth$-$first searc

convention, visits children of a node in lexicographical $($i$.$e$.$ alphabetical$)$ order.$)$