Computer Science: Graphs - Multiple Choice Question When implementing a DFS with a stack, if we don't keep track of the node that pushed the vertice onto the stack, how will the algorithm process the adjacency lists? A. Nodes are visited in the same order as the recursive algorithm but the adjacency lists are processed in reverse order. B. Nodes are processed in reverse order of the recursive algorithm but the adjacency lists are processed in the same order. C. Nodes and adjacency lists are processed in reverse order compared with the recursive algorithm.