A heuristic function h$($n$)$ is used in search algorithms to estimate the cost of reaching the goal from node n$.$ Under which of the following conditions is the heuristic considered admissible?

Group of answer choices:

The heuristic value h$($n$)$ is always equal to the actual cost of reaching the goal from node n and must provide the exact solution in every scenario.

The heuristic value h$($n$)$ is always greater than or equal to the actual cost of reaching the goal from node n$,$ but it can overestimate the cost in certain cases.

The heuristic value h$($n$)$ is always less than or equal to the actual cost of reaching the goal from node n$,$ and it never underestimates the cost.

The heuristic value h$($n$)$ is always less than or equal to the actual cost of reaching the goal from node n$,$ but it may sometimes underestimate the cost.