Heuristic function h(n) is ________ A. Lowest path cost B. Cheapest path from root to goal node C. Estimated cost of cheapest path from root to goal node D. Average path cost

[amp_mcq option1=”Lowest path cost” option2=”Cheapest path from root to goal node” option3=”Estimated cost of cheapest path from root to goal node” option4=”Average path cost” correct=”option3″]

The correct answer is C. Estimated cost of cheapest path from root to goal node.

A heuristic function is a function that estimates the cost of the cheapest path from a given node to the goal node. It is used in heuristic search algorithms to guide the search towards the goal node.

Option A is incorrect because the lowest path cost is the actual cost of the cheapest path from the root node to the goal node. This is not what a heuristic function estimates.

Option B is incorrect because the cheapest path from root to goal node is the actual path that has the lowest cost. This is not what a heuristic function estimates.

Option D is incorrect because the average path cost is the average of the costs of all possible paths from the root node to the goal node. This is not what a heuristic function estimates.