Problem $2.(15$ points$)$ Let $G=(V,E)$ be an undirected graph. Edit Algorithm $1$ to turn it into

an algorithm that identifies the connected component of each node. Your code should assign an

extra attribute $v.$comp for each vinV that gives the index of the connected component that $v$

belongs to $($i$.$e$.,v.$comp$=2$ means $v$ belongs to the $2$ nd connected component$).$ The exact number

label for each component is unimportant; you must just ensure that $v.$ comp $=u.$comp if nodes

$u$ and $v$ are in the same component, and ensure that the maximum label equals the number of

connected components. ${?}^1$

Provide a basic explanation for what your pseudocode is doing, and explain what its runtime is

$($you should try to make the asymptotic runtime as good as possible$).$