\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
Consider the graph \(G\) given by the following adjacency matrix (vertices are ordered alphabetically: A, B, C, D):$$ \mathbf{M} = \begin{pmatrix}0 & 1 & 1 & 0 \\ 1 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 0 & 1 & 1 & 0\end{pmatrix} $$
  1. Draw the non-directed graph \(G\).
  2. Find the number of walks of length 2 from vertex A to vertex D.
  3. Find the number of walks of length 3 from vertex B to itself.

Capture an image of your work. AI teacher feedback takes approximately 10 seconds.