Give a direct proof: For every undirected graph G $($with no self$-$loops or

multi$-$edges$)$ with n nodes, if every node has degree at least n$1$

$2$

$,$ then G is connected