Q$4.$

Find the adjacency matrix of the following graph $G$ and hence find the number of different paths of length $3$ between the vertices $A1$ and $A5$ of $G$ :

$(2$ marks$)$