Question 2: (1 point) Note that for the following question you should use technology to do the matrix calculations Consider a graph with the following adjacency matrix 01 1 0 0 0 1 01 0 0 1 001 01 1 00 1 1 0 0 0 1 010 1 Assuming the nodes are labelled 1,2,3,4,5,6 in the same order as the rows and columns, answer the folllowing questions (a) How many walks of length 2 are there from node 4 to itself? (b) How many walks of length 6 are there from node 4 to itself? (c) How many walks of length 6 are there from node 6 to node 3? (d) How many walks of length 7 are there from node 6 to node 3? Question 3: (1 point) (a) Determine E, a product of elementary matrices, which when premultiplying A performs a Gauss-Jordan pivot on the (3,3) entry of 1 0 -4 2 0 0 4 8 To enter a matrix click on the 3x3 grid of squares below. Next select the exact size of the matrix you want. Then change the entries in the matrix to the entries of your answer. If you need to start over then click on the trash can (b) Enter the product EA. It should be in reduced row echelon form