Problem $3.(12$ points$)$ Consider the following statement:

If $\backslash ($ G$=($V$,$ E$)\backslash )$ is a directed graph, performing a breadth$-$first search in $\backslash ($ G $\backslash )$ starting from some node $\backslash ($ s $\backslash$in V $\backslash )$ will return the weakly connected component that $\backslash ($ s $\backslash )$ belongs to in $\backslash ($ G $\backslash ).$

Explain why this statement is false. Then explain how to change it slightly into a statement that describes a strategy that does use a BFS in some way to successfully find the weakly$-$connected component for $\backslash ($ s $\backslash )$ in $\backslash ($ G $\backslash ).$