Given an unweighted graph G $=($V$,$ E$)$ with designated source vertex u belongs to V$,$ consider running the Breadth First Search

$($BFS$)$ algorithm on G from u$.$ Let be the resulting BFS tree rooted at u$,$ and let x belongs V be any

vertex in T$.$

True or False: The degree of vertex x within the BFS tree T is identical to the degree of x in the original graph G$.$

Hint: Look at IntroToGraphs Slide number $16.$

Select one:

True

False