Question 1 Select the ONE true statement about the following graphs. *B6 Only the first graph is a tree. None of the graphs is a tree. All three of the graphs are trees. Only the third graph is a tree. Question 2 5 29 o The connected graphs has at least one Euler path. Select the set of vertices that describes an Euler path in the graph. D F N B O A.B.E.C,B,D,C,FD O A.B.E.C.F.D O D.C.E.BA O D.F.C.E.B.A