A heuristic function h$()$ is a function that takes as input a node $\text{'}$n$\text{'}$ and returns...

Group of answer choices

$..$ an estimate of the lowest cost of a path from $\text{'}$n$\text{'}$ to a goal node.

$..$ an estimate of the lowest cost of a path from the start node to a goal node.

$..$ an estimate of the highest cost of a path from $\text{'}$n$\text{'}$ to a goal node.

$..$ an estimate of the lowest cost of a path from the start node to $\text{'}$n$\text{'}$