We have seen that, when trying to answer the Traveling Salesperson Problem $($TSP$),$ there are optimal but slow algorithms like Brute Force, and fast but heuristic algorithms like Nearest Neighbor. Which one you use might depend on the problem you are trying to solve.

Give an example of a problem or application $($either involving the Traveling Salesperson Problem or a different network analysis problem$)$ where it would make sense to use an optimal but slow algorithm, and an example of a problem or application where it would make more sense to use a fast but heuristic algorithm.