Prove that every non-leaf in a tree is a cut-vertex. (Recall a cut-vertex is a vertex whose removal will disconnect the graph). Hint: Show two neighbors of the non-leaf x are in different components of T - X.