Can you tell me how to solve it?

2 Search Problem 1 Misc 1. Consider the two graphs shown in Figures 1 and 2. In what order does BTS, DFS and UCS (assume you use the graph scarch version) cxpand the nodes for cach graph (assume that nodes are added to the stack/queue in alphabetical order)? The agent starts at nodes and must reach node g. (Note: All iterations might not be necessary.) (Note: The CurrNode in the table represents the current rode that is being removed/expanded. Queue/Stack represents the frontier and contains all the nodes that are added to frontier. For each iteration, show the Current Node being expanded and the nodes contained in the Qucuc/Stack in the correct positions of the given tables.) Figure 1: Graph A Table 1: Answer: BTS DES UCS Iter. Qucuc CurrNode Qucuc Curr Node Queue