(d) (8 marks) For the following questions, consider the adjacenty matrix MD shown below that represents a graph GD. The products of the matrix multiplication MY and MY are also given. Unfortunately, you spilled coffee on your notes and some entries in the matrices are unreadable (marked with ?) and so you will not be able to draw the graph (but you realise that doing so is not necessary and, in fact, would be too time consuming and error-prone!). b a b a C 0 3 0 a HONOR a 1 1 0 2 1 0 3 JOHNR 1 0 1 0 MB 0 0 MD 0 1 0 C 0 0 O O O O 0 i. What is the total number of walks starting at node d and ending at node d of length 1 in graph GD? ii. What is the total number of walks of length 2 in graph GD? ili. What is the total number of walks starting at node b and ending at node c of length 3 or less in GD? iv. What is the total number of walks starting and ending at node c of length 4 in graph GD? ( You should need to perform less than 5 multiplications.)