can you do it for iterrative deepning search using python language please
Write a program to solve the 8-puzzle problem using the following search algorithms; • Breadth-first search • Uniform-cost search • Depth-first search • Iterative deepening search • Greedy Best Search • A* Search Test all the algorithms with at least 10 random inputs and calculate both the number of nodes expanded and the maximum number of nodes saved in the memory. Write a report giving the results of your experiments and make comments on the results. The problem. The 8-puzzle problem is a puzzle popularized by Sam Loyd in the 1870s. It is played on a 3-by-3 grid with 8 square blocks labeled 1 through 8 and a blank square. Your goal is to rearrange the blocks so that they are in order. You are permitted to slide blocks horizontally or vertically into the blank square. The following shows a sequence of legal moves from an initial board position (left) to the goal position (right), 013 1 0 3 1 2 3 1 2 3 1 2 3 4 25 => 4 2 5 => 405 => 4 50 => 4 5 6 7 86 7 86 78 6 7 8 6 7 80 initial goal You should submit your report in a paper format having the following sections. Introduction : Rationale behind the work, Problem definition, background, importance, assumptions, organization of the paper, Experimental Setup: How to perform the experiments, coding platform, input data, etc. Experimental Results: Screen shots, tables and figures of time/space complexity, etc. Discussion: Analysis of the results etc. Conclusion: Summary of the project, concluding remarks...