The DFS algorithm, as we have implemented it, expands nodes in a 'first in, last out' basis. In other words, whenever the algorithm selects a node to expand, it will select the node that was added most recently. Determine the order in which nodes will be expanded if DFS is applied to the search problem represented by the search tree above. Select the answer from the options below.
1) A C F L M
2) A B D H I E J K
3) A C G O N F M
4) Cannot be determined
