1. In a simple graph, define the degree of each vertex as d(i) = |N(i)|, the number of neighbors that vertex i is connected to. For the following simple graph:

4 6 (a) Write the adjacency matrix for the graph. 10 points Answer only no explanation needed. Here is a matrix template to be edited ere 1s a matrix template (b) List the degree of each vertex, as a set of ordered pairs { (i,d(i)) i EV) [5 points Answer only; no explanation needed