Applying Various Search Strategies to a State Space Theodoros Assume that you have the following search graph, where S is the start node and G1 and G2 are goal nodes. Arcs are labeled with the cost of traversing them and the estimated cost to a goal is reported inside nodes. Apply the search strategies listed below to the search graph:, (a) indicate which goal state is reached if any, (b) list, in order, the states expanded, and (c) show the final contents of the OPEN and CLOSED lists. (Recall that a state is expanded when it is removed from the OPEN list.) When there is a tie with respect to which node has to be expanded next, nodes should be expanded in alphabetical order. The used search strategies include; 4. A* (using f= g+h) 5. SMA* (using f=gth and limiting the open-list to just 3 elements) KEY s 10 cost of itaveising this atc is X N estimated cost to heatest goal is Y 7 3 5 O 1 A 5 3 LO B 8 F 8 9 4 G2 CO 1 2 4 5 G1 0 D 2 E 4 NI