A digraph is a graph with directions on its edges. The topological sorting problem asks to list vertices of a digraph in an order such that for every edge of the digraph, the vertex it starts at is listed before the vertex it points to$.$ This problem has a solution if and only if a digraph is a dag $($directed acyclic graph$),$ i$.$e$.,$ it has no directed cycles.True$/$False