Let G be the digraph of relation R. Below is the adjacency matrix of G. A=113342000131100401001010 Fill in the following matrix A(2), formed by computing the Boolean product of A with itself. If you are having trouble typing in the rightmost columns, try zooming out in your web browser. Question 6 Consider again relation R and matrix A(2) from Question 5. A(2) is the of RR. Question 7 Consider again graph G and matrix A(2) from Question 5. Is there a walk in G of length 2 from vertex 2 to vertex 3 ? Is there a walk in G of length 2 from vertex 4 to vertex 1