Why doesn't increasing order of the post no gives sink (node in strongly connected sink component of the corresponding DAG of graph) node in graph?

Thats because of the charachteristic of strongly connected components. It says that every node of the component has to reach every other node of the component. With the first DFS you find all nodes a node can reach.

The dfs of the reverse graph gives you all nodes a node can be accessed from.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.