Urgent help!! Please complete this question as soon as possible

Question 1 (13 points) Q.1) Graph Theory: Consider the following incidence matrix of a graph G = (V, E) with V = {a, b, c, d) and {e1, ez, e3, es, es, es} C1 e2 e3 eA e5 0 M = O C 0 Based on the information you obtain from the incidence matrix M, answer these questions: (a) What type of graph does M represent? (b) Find the adjacenty matrix A for this graph. (c) Draw the graph. (d) How many paths of length 2 are there between nodes b and c. (e) In terms of connectivity in the graph, what is your interpretation of tr(A2)? [The question is not about the value.] [2+3+2+3+3-13 marks]