Assume that you have available a function $("$DFS$($graph$,$ starting$\_$node$)")$ that performs a Depth First

Search on a graph starting from a given starting node. Assume that the function traverses nodes in

alphabetical order and also that the function skips the traversal of any node that has already been

traversed. Below are the input graph and the starting$\_$node:

Input graph:

Starting$\_$node $=J$

The sequence of nodes visited$=.$

$($Please specify the sequence as common separated list without any

whitespaces, Eg if starting from node A: A$,$B$,$C$,$D$,...)$