The topological sort algorithm runs DFS on the given DAG and orders vertices in decreasing order of their finish time. Prove why this algorithm is correct. That is for every egde $($u$,$v$)$ show u$.$f $>$ v$.$f$.$