In an undirected graph, the degree d(u) of a vertex u is the number of neighbors u has, or equivalently, the number of edges incident upon it. in a directed graph, we distinguish between the indegree din(u), which is the number of edges into u, and the outdegree dout(u), the number of edges leaving u.

(a) show that in an undirected graph, σuₑvd(u) = 2| e |.
(b) use part (a) to show that in an undirected graph, there must be an even number of vertices whose degree is odd.
(c) does a similar statement hold for the number of vertices with odd indegree in a directed graph?