The “Half-Manhattan distance” heuristic is equal to the Manhattan distance divided by two. explain how the use of this heuristic would or would not affect the optimality properties of (i). Greedy...

The “Half-Manhattan distance” heuristic is equal to the Manhattan distance divided by two. explain how the use of this heuristic would or would not affect the optimality properties of (i). Greedy Best-First Search,(ii). Uniform-Cost Search, and (iii.) A* Search