Find the topological order of the graph. Use the breadth-first topological ordering algorithm in the book. Show the predecessor count array, the queue, and the topological ordering array at initialization and at each iteration of the algorithm.

4 2 0 3