Apply the DFS algorithm on the undirected graph and show its traversal starting at vertex a$.$ Assume that vertex's adjacencies are considered in alphabetical order. Highlight visited vertices and explored edges with discovery edges drawn as solid lines $($or use a highlighter$)$ and non$-$tree $($back $)$ edges as dashed lines. Label each edge with integer numbers as $1,2,3,$ in the order of discovery. I need you to draw on the graph itself the traversal path, or write out the steps $($ex$.1$ a to b$).$ Do not provide code, that is not what I am looking for or asking for.