The 8-puzzle problem starting from the initial state 1 3 5 to the goal state 12 3 4 2 7 8 6 7 8- a) Using Depth first search, show the search tree that would be built down to level 4 (assume level zero is the root of the tree) Using Breadth first search, show the state of the search tree down the level 3 b)