Compute the topological sort of the following graph using the algorithm from the lecture $($chapter

$C2,$ slide $27,$ handout$4$ version$).$

When choosing the next node to start a depth$-$first search on or choosing the next successor,

choose the node with the smallest index.