$($b$)$ We say that the graph $G$ is connected if for every pair of vertices $u,$vinV$(G),$ there exists a path from $u$ to

$v.$ Design an algorithm to determine whether $G$ is connected. Your algorithm should only traverse the graph

once$-$ this means that you should not apply BFS or DFS more than once. Your solution should provide

enough detail that a CSCI $2270($data structures$)$ student could reasonably be expected to implement your

solution.

Answer for Part $($b$).$