I need verbal explanation, plz. Pseudo code may help, but not code only.

Problem 3: Suppose that you are traveling on a river by canoe. There are n canoe rental shops along the river. At each shop, you can pick up a canoe or drop off a canoe. The cost for renting a canoe from shop i to shop j is givein by cij. There is no relationship between the different c values. You need to go from the first rental shop to the last rental shop. Design a dynamic programming algorithm to determine the minimum cost of such a trip. Hint: Let C[i] represent the cheapest way to get to rental shop i. How would your solution change if you also have to keep track of which shops you should rent from and drop off to in order to achieve the minimum cost trip? Hint: Define Cli to be the cheapest way to get to rental shop i. If you stop at shop i, which rental shops could you have potentially stopped at immedi- ately before you got to shop