Consider the example discussed in the class lecture, what is the order of visits of the nodes, the path and the cost returned by BFS \& DFS. DEPTH FIRST SEARCH. Order of node expansion: Path found: Cost of path found: BREADTH FIRST SEARCH. Order of node expansion: Path found: Cost of path found: UNIFORM COST SEARCH Order of node expansion: Path found: Cost of path found: a. Givea the 3 saren space regions in a Goal-based agent. Explain this Pseudocoue in your in irords. flaction Grapii-SEAircir(initisiState, goalTest) returns SuCCESS or FAluze : iaitialize froatier with initialstate cxplored = Set.nesv() while sot frontier.isEmpty ( : state = frontier.remove() explored.add(state) if gonil gest (state): recura Succass(state) ivx neighbor in state, neighbors(): if neightor not in frontier U explored: frontier.add(neighbor) recurn SAILUE