Present a complete O$($m$+$n$)$ time algorithm that given graph

G$,$ returns the largest vertex in the component containing vertex $1.$

For example, if the component with vertex $1$ has the set $\{2,1,4,9,6\}$

of vertices, then the algorithm returns $9.$