Prove that in an undirected graph, ${\displaystyle \underset{\text{u}\text{i}\text{n}\text{V}}{\overset{?}{}}}$ degree $(u)=2|E|.$ Conclude that there must be an even number of vertices with odd degree. Does a similar statement hold for the number of vertices of odd indegree in a directed graph?