$4$ points

Recall the Breadth First Search algorithm that starts from vertex s of an undirected graph $G$ and creates the sets $L1,$dots,$Lm.$

True or false: Given a vertex u and an integer $k1,$ if u is contained in the set Lk $,$ then no path G from s to u has length greater than k $.$

$$rue

False