Consider the 8-puzzle problem with the following configuration: (2, 8, 3; 1, 6,4; 7, B, 5), where B is the blank tile (row-wise) Show the different steps for the Hill Climbing algorithm assuming the following two heuristics: i. h1(n) = Number of displaced titles ii. h2(n) - Total Manhattan distance

What happens to (B) above for the first heuristics (only) under the following conditions (explain the steps with proper rationale): i. What happens if we make a new heuristic h3(n) = h1(n) + h2(n)? ii. What happens if you consider the blank tile as another tile?