(4pts) For a simple (i.e. no multi-edge, no self-loop) undirected graph, the degree of a vertex is the number of edges connected to it. Prove that for any graph, the number of vertices of odd degrees is even. [Hint: what's the sum of degrees of all vertices?]