Define the degree of a vertex of an undirected graph as the number of edges incident on that vertex. Prove that an undirected graph must have an even number of vertices of odd degree.