Q$7$

Given a graph $G$ represented using adjacency lists, run BFS$($G$).$ Let $G_B$ be the breadth$-$first tree$($s$)$ produced by the BFS$.$ Determine whether each of the following statements is true or false.

If $G$ is an undirected graph, then the number of trees in $G_B$ will always be the same $($independent of the orders of the vertices and edges given in the adjacency lists$).$

If $G$ is a directed graph, then the number of trees in $G_B$ will always be the same $($independent of the order of the vertices and edges given in the adjacency lists$).$

True

False