Given an arbitrary digraph G $($may not be a directed acyclic graph, DAG$)$ of n vertices

and m edges, design an algorithm which computes a topological order of G if G is a

DAG, otherwise computes a cycle of G$,$ in O$($m$+$n$)$ time, and analyze your algorithm.