For which of the following situations would it be best to use a heuristic in order to find a solution that runs in a reasonable amount of time? A Appending a value to a list of n elements, which requires no list elements be examined.
B Finding the fastest route that visits every location among n locations, which requires n! possible routes be examined.
c Performing a binary search for a score in a sorted list of n scores, which requires that fewer than n scores be examined.
D
Performing a linear search for a name in an unsorted database of n people, which requires that up to n entries be examined.

The situation that should be best to use a heuristic in order to find a solution that runs in a reasonable amount of time is option B.

The following information should be considered:

Learn more: link

The answer is "Option B".

Explanation:

In this question, determining the optimal path between several locations, which requires n!. It's also examining possible routes. It could just suggest here, designers need to do those equations as we have several forms. They have several methods to find the best and efficient path. Its basic idea is to use heuristic approaches for complex or uncertain issues so we do not provide proven solutions for linear programs.

(because i need 20 chars)