To implement Depth-First Search (DFS), Uniform-Cost Search (UCS), Best-First Search (BFS), and A Algorithm to solve the following problems (i.e. find the goal): 1) 8 Puzzle Problem: The 8 puzzle consists of eight numbered, movable tiles set in a 33 frame. One cell of the frame is always empty thus making it possible to move an adjacent numbered tile into the empty cell. Start with a random state (cannot be fixed). The goal state is listed below. The program is to change the initial configuration into the goal configuration. A solution to the problem is an appropriate sequence of moves. You must write your own codes for the algorithms. Make sure your submission meets all of the requirements and free of plagiarism. Your program should be able to address any initial configuration and provide a table of statistics below in your PDF file