$(5$ bonus pts$.)$ In Lecture $11$ we showed that in order to obtain a special order to run DFS to identify all connected components in a directed graph $G,$ we need to build the reverse graph $G_R$ of $G$ and then run DFS$-$with$-$timing on $G_R$ to get the resulting postlist $($termed polistlist$\_($R$)),$ which is the special order. You might wonder if running DFS on $G$ to obtain the postlist followed by reversing it would also result in a correct special order. Show that this approach does not work by giving an example. You need to draw a directed graph $G($the example$),$ show all connected components of $G,$ show the postlist after running DFS$-$with$-$timing on $G,$ show the visited array after runing DFS following the reverse of the postlist, and verify that it does not give the correct connected components.