(m ightarrow n ightarrow 0 ightarrow q ightarrow n ightarrow p ightarrow 0 ightarrow n ightarrow m)

\(m \rightarrow n \rightarrow 0 \rightarrow q \rightarrow n \rightarrow p \rightarrow 0 \rightarrow n \rightarrow m\)

Use Graph \(K\) in Figure 12.352. Identify each sequence of vertices as a closed walk, circuit (closed trail), and/or directed cycle (closed path). Indicate all that apply.