Question: a. Consider a heuristic function that is exactly correct. (i.e. h(n)= the cost of optimal path from n to a solution.) Give an example search

a. Consider a heuristic function that is exactly correct. (i.e. h(n)= the cost of optimal path from n to a solution.) Give an example search space where Greedy Best-First Search using this heuristic will give a suboptimal solution. You may either draw a graph or give a full explanation
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
