Question: Consider the following algorithm to solve the negative-weighted, shortest-path problem: Add a constant c to each edge cost, thus removing negative edges; calculate the shortest path on the new graph; and then use that result on the original. What is wrong with this algorithm?