1. A nice tree of an undirected graph G = (V, E) is a subset TCE of edges that is acyclic and connected. Prove that: (a) every nice tree of a graph with n vertices has n 1 edges, (b) if T CE is a subs