QUESTIONS Given the graph Gabcdeb, al. (0, el. d. c.id, 11. teig in the following blanks to produce true statements about properties Note: For any unnecessary blanks, use zero to fill the extra digits starting from the left to right. For example, if only one digt is needed to express a solution e) but there are two banks, write the solution as 03. MG) True or false G is directed . True or false G is planar. . Wertex.connected edge-connected True or false is Hamiltonian V XG) - How many elements of must be removed to produce a spanning tree of 67 How many additional edges could be added to G? . If all edges possible were in E What would be What would be QUESTION 9 Given the graph G tabcdefgabalb, el(d, bl.id, (d.n. (el. of. dgld) in the following blanks to produce true statements about properties Noter For any unnecessary blanks, use zero to fill the extra digits starting from the left to right. For example, if only one digit is needed to express a solution (eg, but there are two blanks, write the solution as 03 MG) True or false: G is directed True or false: G is planar True or false is strongly connected True or false G is Hamiltonian xG) - True or false, it is not possible to derive a spanning tree from How many additional edges could be added to y . If an edges possible were in E What would be What would be