Part A)

I need Solution for part B)

Given the initial state and the goal state of the following five-puzzle problem (Figure 1) a. Construct a state-space graph of depth 3, beginning with the given initial state. Each operation within the graph moves one tile only. Successors of a given state are expanded in the following order up, left, down, right. b. Using the state-space graph you developed in a., find the goal state by conducting: 1. A blind breadth-first search strategy (show the sequence of visited nodes) 2. A depth-first search strategy (show the sequence of visited nodes) 3. Show, on the tree, the sequence of visited nodes when applying the improved breadth first 4. Show, on the tree, the sequence of visited nodes when applying the improved depth first Figure 1: Five-puzzle problem: (a) initial state; (b) goal state