A friendship graph G is defined by the following adjacency matrix (A) that consist of 6 friends a,b,c,d, e, and f: A = [0 1 0 0 1 1 1 0 1 1 1 0 0 1 0 1 0 0 0 1 1 0 0 1 1 1 0 0 0 1 1 0 0 1 1 0] a) Represent G by means of i) a diagram, ii) a set definition. b) Identify i) the degree of vertex b, ii) a closed path of length 5 beginning at d, iii) a subgraph of G. c) Show using the adjacency matrix, the number of paths of length 2 from a to e and list the paths. d) State giving a reason for your answer if the graph G is i) Planer, ii) Eulerian, iii) Hamiltonian