Consider the undirected, unweighted graph below. Assuming that node S is the starting point (i.e., first node to be visited) and that whenever a node has multiple neighbours that need to be processed by the algorithm the neighbours would be processed in lexicographical order, answer the following questions regarding the order in which the nodes are visited in a Depth-First Search (DFS) run.