help asap

Given the graph, G = (V, ), below, fill in the following blanks to produce true statements about G's properties: G planar G Hamiltonian X(G) - Gis vedge-connected (8,0) - . The weight of G's minimum spanning tree is . G 2-colorable. 6 2 d 6 f 4 2 1 3 es c 2 QUESTION 6 Let G = (V, E) be a graph where: V = {a, b, c, d, e, E = {(e, a),(a, b), (b, c), (d). (d. e) (e. ). V. d)} Fill in the blanks below to produce true statements: v directed. V v V.C. The shortest path from e to dis A walk from fto cis:f. Gis v (vertex) connected The largest cycle in G is size . The smallest cycle in G is size- . G Hamiltonian. QUESTION 4 Let A = (0,0). {{0}}). Which of the following statements regarding A are true? DE PIA) O ACPIA) DEA fro}} (A) {0}}}E PA P(A) = 3 P(A) = 9 DE PIA) BAE PIA) 3= |A| QUESTION 5 Let A, B, and be sets where: A = {XEN:X120); B={yez:lyi