Prove that every nontrivial tree has at least two vertices of degree 1 by filling in the details and completing the following argument: Let T be a nontrivial tree and let S be the set of all paths from one vertex to another of T. Among all the paths in S, choose a path P with the most edges. (Why is it possible to find such a P?) What can you say about the initial and final vertices of P? Why?