Could someone please help me with the problems below

Could someone help me with the problem below

Consider this statement: In any directed graph G = (V, E), when DFS visits a vertex u elementof V, then every undiscovered vertex v such that u has a path to v must be discovered before DFS returns from u. Is this statement true or false? If true, give a proof; if false, give a counterexample. Consider this statement: In any undirected graph G = (V, E), there must be an even number of vertices whose degree is odd. Is this statement true or false? If true, give a proof; if false, give a counterexample