Artificial Intelligence Problem:

PLEASE ANSWER ALL PARTS OF THE QUESTIONS WITH FULL EXPLANATIONS

Consider the following "Rush Hour" puzzle. Recall that the rules for solving the puzzle are that vehicles can move only back or forward (no turning). The goal is to get the red car out of the parking lot through the exit at right. 2.1 (1 pt) Solve the problem and present your solution 2.2 (7 pts) Give as accurate an estimate as you can for the size of the problem space for this puzzle. (The estimate should be for this instance of the puzzle, not a "general" estimate 2.3 (7 pts) Suggest a plausible "h" function that would be appropriate for A* search for a general instance of the Rush Hour puzzle. (The function should be a non-trivial but easily computable underestimate of the number of moves required to solve the puzzle from a given position.) 2.4 (5 pts) Did your solution in 2.1 have features in common with (e.g.) depth-first search? Breadth-first search? Means-ends analysis? Would bidirectional search be a good idea for this puzzle? Why or why not