Explain

- Consider the problem of deciding whether a digraph G is acyclic or not (i.e., whether G has a (directed) cycle or not). - State precisely in pseudo code the algorithm as outlined in the lecture script (as has been made available on Canvas for CS-270). - It is essential here that the linear-time algorithm from the module, based on the analysis of topological sorting, is used (other algorithms won't be accepted). Take care that the algorithm runs in linear time. - The main building block here, DFS, can be used as a function from a library, without implementation, but the output of the DFS function must be precisely stated. [6 marks]