In what order does BFS, DFS and UCS (assume you use the graph search version) expand the nodes for each graph (assume that nodes are added to the stack/queue in alphabetical order)? The agent starts at node s and must reach node g. (Note: All iterations might not be necessary.)

2 Figure 1: Graph A Table 1: Answer: BFS DFS UCS Iter. QueueCurrNode Stack-CurrNode Queue