Given a DAG (Directed Acyclic Graph), in which we know the adjacencies represent the order in which to perform a task, and the vertices are tasks, we want to place the vertices in a sequence. We mu…