Consider the following undirected graph G$=($V$,$E$)($undirected means no directed edges in the graph$).$ Apply Depth First Search Algorithm to determine the finishing time of each vertex. Consider the vertices in alphatecial order, in other words a before b$,$ b before c and so on and for example if vertex x is adjacent vertices k$,$ b$,$ w and r then consider first vertex b$,$ then vertex k$,$ then vertex r and finally vertex w$.$ Start the depth first search from vertex $"$a$".$

Show the steps of the algorithm on paper.

V $=\{$ a$,$ b$,$ c$,$ e$,$ f$,$ g$,$ h$,$ i$,$ j$,$ k$\}$ and E$=\{($a$,$ e$),($a$,$ c$),($a$,$ f$),($b$,$ f$),($b$,$ g$),($c$,$ e$),($c$,$ g$),($f$,$ g$),($h$,$ i$),($h$,$ k$),($i$,$ j$),($j$,$ k$)\}$