An algorithm A is admissible if ___________ A. It is not guaranteed to return an optimal solution when one exists B. It is guaranteed to return an optimal solution when one exists C. It returns more solutions, but not an optimal one D. It guarantees to return more optimal solutions

The correct answer is: B. It is guaranteed to return an optimal solution when one exists.

An admissible algorithm is one that always returns a solution that is no worse than the optimal solution. In other words, if an optimal solution exists, then an admissible algorithm will always find it.

Option A is

42.9-11.4 132.3-11.4 132.3s0 89.4 11.4 132.3c6.3 23.7 24.8 41.5 48.3 47.8C117.2 448 288 448 288 448s170.8 0 213.4-11.5c23.5-6.3 42-24.2 48.3-47.8 11.4-42.9 11.4-132.3 11.4-132.3s0-89.4-11.4-132.3zm-317.5 213.5V175.2l142.7 81.2-142.7 81.2z"/> Subscribe on YouTube