Explain how you could modify iterative deepening search so that it finds the lowest cost solution,

Show that an inadmissible heuristic can lead to A* returning a suboptimal example, by giving an example search tree and heuristic where this occurs. Aim for as small a tree as possible, and explain your example clearly.

find the cost of your paper