Question 5 4 Points Suppose that is a simple graph in which all the n vertices have a degree of at least 2 prove that G has at least n edges. Use the editor to format your answer Question 6 10 Points Q3(1).png The two graphs below are isomorphic. W2 W3 W4 a2 03 05 16 wi W6 w5 ai a4 (a) Exhibit an isomorphism by mapping the vertices of the first graph with the vertices of the second graph with f(ai) = f(az) = f(a3) = f(26) = f(04) = f(a5) = (b) Use adjacency matrices to prove your answer in part (a). Use the editor to format your