What is the order in which states will be explored using BFS or DFS?
Suppose we have breadth-first search and depth-first search algorithms wherein states are added to the frontier in alphabetical order. Assume we do not permit any redundant/loopy paths. Consider the task of finding a path from G to H. Yes, I know that H is not on the graph. What is the order in which states will be added to the frontier using breadth-first search? Which node is the parent of node F? a. DFG