(10 points) There are n trading posts along a river, numbered 1to n as you travel downstream. At any trading post i you can rent acanoe to be returned at any of the downstream trading posts j,where j ≥ i.
You are given a table R[i, j] defining the cost of a canoe which ispicked up at post i and dropped off at post j for 1 ≤ i ≤ j ≤ n.Assume that R[i, i] = 0 and that you can’t take a canoe upriver (soperhaps R[i, j] = ∞ when i > j). However, it can happen that thecost
OR
OR