3. Write the adjcency matrix and the incidence matrix for the following graph. Deseribe how one would determine the degree of each vertex from the adjacency matrix. (The graph, clearly, is not a simple graph. Hence, each edge between two different vertices would contribute 1 to the total in each of the appropriate cells of the adjacency matrix and each self-loop at a vertex would contribute 2 to the total in the appropriate cell of the adjacency matrix.) x1 b r9 x10