A connected undirected graph is a tree if it has no simple circuits.

Question $1$ options:

True

False

Question $2(1$ point$)$

There can be more than one simple path between two vertices of a tree.

Question $2$ options:

True

False

Question $3(1$ point$)$

A rooted tree where every internal vertex has exactly $3$ children is called a full binary tree.

Question $3$ options:

True

False

Question $4(1$ point$)$

All graphs have a spanning tree.

Question $4$ options:

True

False