Actually i want a best solution for this .

Question 1 Consider the following i) Calculate the adjacency matrix f or this graph. 12 marks] ii) iii) iv) Use the adjacency matrix to determine the number of paths of length 2 that end at B Calculate the Euler characteristic of the graph. Explain why this graph does not have an Euler path. [2 marks] 12 marks] [l mark] Question 2 Draw a digraph that matches the following adjacency matrix, 0 1 00 To make it easier to mark, please use the following picture as a starting point. Marking: 3 marks for perfectly correct, 2 marks minor error, 1 mark major error, 0 marks completely incorrect. [3 marks]