Question $1$

Trees

Select all the statements that are true.

Every undirected graph with $n$ nodes and at most $n-1$ edges has no cycles.

For any two vertices $u$ and $v$ in a tree, there is a unique path from $u$ and $v$ in the tree.

Every tree with $n2$ nodes has at least two vertices of degree $1.$

Every connected undirected graph with $n$ nodes and at most $n-1$ edges is a tree.