Which of the following problems can be solved using the Bellman-Ford Algorithm?

A

You are given a map with cities and roads connecting the cities. Find the shortest path from your starting city to all of the other cities on the map.

B

You are given a graph with business decisions and their corresponding costs and profits. No sequence of decisions that can be repeated results in a total profit. Find the least expensive sequence of decisions.

C

You are given a graph with business decisions and their corresponding costs and profits. There may exist sequences of decisions that can be repeated that will result in a total profit. Find the least expensive sequence of decisions.

D

Only the first two problems can be solved by the Bellman-Ford Algorithm.

E

All of the above problems can be solved by the Bellman-Ford Algorithm.