Let M be the following vertex matrix of a directed graph: (a) Draw a diagram of the

Question:

Let M be the following vertex matrix of a directed graph:

(a) Draw a diagram of the directed graph.
(b) Use Theorem 11.7.1 to find the number of 1-, 2-, and 3-step connections from the vertex P1 to the vertex P2. Verify your answer by listing the various connections as in Example 3.
(c) Repeat part (b) for the 1-, 2-, and 3-step connections from P1 to P4.