Problem $6.$

We are given a graph $\backslash ($ G$=($V$,$ E$)\backslash )$ which is undirected. Design an $\backslash ($ O$($V$+$E$)\backslash )$ algorithm to determine if the graph G is connected. Use pseudo$-$code to design the algorithm. Your algorithm should return TRUE $($if the graph G connected$)$ or FALSE $($otherwise$).$ If you use an algorithm discussed in class, you can call directly that algorithm.

Note: the graph is connected if there is a path between any two vertices $\backslash ($ u $\backslash )$ and $\backslash ($ v $\backslash ).$