Answer Happy

Please I need a detailed explanation to this work for better
understanding. Thank you.
5. Suppose you have the following search space: State next B С cost 4 1 D E 3 8 0 A A B B С С С D D E F С D F С E G G 2 6 2 4 2 8 (a) Draw the state space of this problem. (b) Assume that the initial state is A and the goal state is G. Show how each of the following search strategies would create a search tree to find a path from the initial state to the goal state: i. Breadth-first search ii. Depth-first search iii. Uniform cost search iv. Iterative deepening search At each step of the search algorithm, show which node is being expanded, and the content of fringe. Also report the eventual solution found by each algorithm, and the solution cost.