Consider the below initial and goal state of 8-puzzle problem and answer the following questions to apply the Greedy Best First Search. Note: The empty tile can be allowed to swap with its immediate neighbor including the diagonal cell as well. [2+3+3-8 Marks] Initial in the Text-Field given below. Goal 1 2 3 45 6 7 8 35 172 84 6 a) Define a suitable heuristic approach to design the cost function and justify your choice. b) Depict the search tree for up to exactly three levels. (Given initial state can be assumed to be on level-0.) c) Show the status of OPEN and CLOSE list at each level.