I need answer urgently for this question. Please help me.

Thank you.

QUESTION 2: a) State whether each of the following statements is TRUE or FALSE. i. A directed graph is reflexive if it has a loop at a node. ii. A graph is called a connected graph if there is no isolated node. iii. Indegree of a vertex is the number of edge pointing out from the vertex. iv . Two graphs are isomorphic if they are the same graphs that drawn differently in which every vertex has different neighbors in both graph. V. Spanning subgraph is a subgraph that contains all the vertices of the original graph. (5 marks)b ) Figure 1 is an undirected graph, G = (V,E) a b e d C Figure 1 i. Determine the size of G. ii . Give an example of a Hamiltonion circuit and justify the answer if the circuit doesn't exist. iii . Give an example of Eulerian path and justify the answer if the path doesn't exist. iv . Give an example of Eulerian circuit and justify the answer if the path doesn't exist. V. Find the spanning tree at rooth for G. (8 marks)