Consider the following statements:
1. A graph in which there is a unique path between every pair of vertices is a tree.
2. A connected graph with e = v - 1 is a tree.
3. A graph with e = V - 1 that has no circuit is a tree.
Which of the above statements is/are true?
1
1 and 3
2
2 and 3
3
1 and 2
4
All of the above