Artificial Intelligence

Consider the search graph shown below. S is the start state and G is the goal state. All edges are bidirectional. S h=9 10 B h=7 h=10 D h=7 7 E h=1 15 1 F b=1 3 h=0 Search Graph Construct the order in which the states will be searched for: 1) depth first search. breadth first search b) Suppose that each letter represents a state in a solution space. The following moves are legal: A5 to B4 and C4 B4 to D6 and ES C4 to F4 and G5 D6 to 17 and JS 17 to K7 and L8 Start state: A5 Goal state: E5 Create the order in which the states will be searched by the best-first search