Question

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 Stack -> CurrNode Qucuc < Curr Node Figure 2: Craph B Table 2: Answer: BFS DFS UCS Queue < Curr Node Stack -> Curr Node Queue < CurrNode Iter.

Answer 1

2. RES Itero Quenc Current Node a, c C, 2 S Sob So by a Sb, a, c S, b, a, c, g a DFS Iter a stack Current Node to CA, C) Я S b So by a S, b, a, g

ucs Iter Queue Current Node 1. slo 6413 2. S(O) a(3),C(3) - 4: 5 4), 915) 9155 Slo), bl1) Sb), b(), 913) Slo),c6(1), (3) 5(e), b(1), 2(3), g(5) B. F.S @ 4 Iter Queue Current Node tid sb s, b, c s, b, c, d s, b, c, d, e. 3, b, c, d, e, g

DFS Current Node . Stack Iter S طرح طری و رط رک و راه رطری ca C, eg ucs. Current Node 1 . Queue (6) Iter. 1 (های (3) ,(1لا (5ة رام 3. 244), elu) (1اط ر(ه) (@ ,(1)اط ر(ه) و ماههC ,(1)ط ر(ه)s ام (ه رع) (1)ط ,(sto ( ce ) , attlefaa (1),(ای (7) ركاع 9 (1) ت نه ای