(a) Draw a graph that has the following adjacency matrix:
2 1 1 0
1 0 0 1
1 0 0 1
0 1 1 0
(b) Label the vertices of your graph A, B, C, and D (in any order).
(c) How many different paths of length 10 are there from the vertex you labeled A to the vertex
you labeled D in the graph you draw in part (a)?
