(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 acanoe which is picked 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 acanoe upriver (so perhaps R[i, j] = ∞ when i > j). However, itcan happen that the
OR
OR