Figure 1: Graph G in Q1. Consider the graph G in Figure 1 to answer the following questions. Explain all the answers. a) What is the sum of degrees of all nodes of G ? b) What is the number of non-zero entries in the adjacency matrix representation of G ? c) What is the number of zero entries in the incidence matrix representation of G ? d) Does G have a complete graph with at least four vertices as a subgraph? If yes, give the subgraph. e) Is G bipartite? Explain your answer. f) How many directed graphs are there that have G as their underlying undirected graph? g) What is the length of the simple longest path in G? Give the path. h) What is the number of connected components of G ? Explain your answer. i) Is there an Euler circuit in G ? If yes, give such a circuit; if no, state the reason. j) Is there an Euler path in G ? If yes, give such a path; if no, state the reason. k) Does G have a Hamilton circuit? If yes, find such a circuit; if no, justify your answer. 1) Does G have a Hamilton path? If yes, find such a path; if no, justify your