Questions 8 and 9 Consider the digraph D with the following adjacency matrix. a b c d e To 0 0 1 1] b 1 0 0 0 0 1 0 0 0 1 d 1 0 1 0 0 0 1 1 0 0 a e Q8 How many walks of length 4, starting from b, are there in D? Q9 How many walks of length 4, ending at c, are there in D? Options for Questions 8 and 9 A 7 B 8 D 13 C11 G 17 E 14 F 16