3.) (30 points) Answer true or false, with justification: (a) If an undirected graph has two vertices of odd degree then there must be a path (b) If an undirected graph G has exactly three vertices of odd degree then G must c) If a connected, undirected graph has two longest simple (as in problem 2 above) between those two vertices. have an Eulerian circuit paths, P and Q, then P and Q must share a vertex