9 Question 5 Draw three non-isomorphic subgraphs of G, each containing exactly 5 vertices. G 6 Question 6 Ineach graph, find either (i) an Eulerian path, or (ii) an Eulerian circuit Give your answers by writing the vertexsequence. If the path or circuit does not exist, write DNE, and explain why. B 2 lov G E G G E… Show more Math MACM 101 Share QuestionEmailCopy link Comments (0)