Prove that the topological sorting problem (the "vertex labeling" problem from Class 21) has a solution if and only if the underlying directed graph is acyclic. Notes: This is a biconditional statement ("if and only if"), so there are two directions to prove. As often happens, one direction is a fair bit easier than the other. You can use the results of the previous problem as necessary