Explain

Consider the following digraph: (a) Run the algorithm developed in the module for computing a possible topological sorting, following numerical order, if there is a choice. Show all steps of the computation. State exactly the obtained ordering (and how it was obtained). [4 marks] (b) Determine whether the obtained ordering is a topological sorting. What follows from this fact alone (without investigating concrete cycles in the digraph) concerning the question whether G is a dag or not? Consider the following digraph: (a) Run the algorithm developed in the module for computing a possible topological sorting, following numerical order, if there is a choice. Show all steps of the computation. State exactly the obtained ordering (and how it was obtained). [4 marks] (b) Determine whether the obtained ordering is a topological sorting. What follows from this fact alone (without investigating concrete cycles in the digraph) concerning the question whether G is a dag or not