Prove the following.If in a graph any two vertices are connected by

Prove the following.
If in a graph any two vertices are connected by a unique path, the graph is a tree.

Data from Prob. 14

Prove the following.
The path connecting any two vertices u and v in a tree is unique.

PROBLEM SET 23.3: