Question 2: You are given a state-space graph that consists of nine states and the costs of the connections between them for each state. Your task is to find a path from start state S to goal state F. For Breadth-first search strategy; figure out the order in which states are expanded, frontier list as well as the path returned by graph search. When choosing an arbitrary order of state expansions (to break ties), use an alphabetical ordering. Remember that in graph search, states are expanded only once. Show the search tree used to find the solution 2 B 5 4 3 4 A 3 C 6 3 4 2 H G D 5 2 3 E F 5