JAVA CODE

Please follow directions carefully:

- be sure your output is printing correctly and all values are correct

I will be sure to give you a thumbs up!

(if you answered this question before, the cost output was not correct and the way you input the matrix was not easy to understand)

Design an algorithm by applying dynamic programming (DP) to solve the following problem and implement your algorithm in Java. You are planning for a canoe trip down a river. There are n trading posts along the river, numbered 1,2,n such that trading post 1 is furthest upstream and trading post n is furthest downstream. At any of these trading posts, you can rent a canoe, which may be returned at any other trading post downstream. The trip begins at trading post 1 and ends at trading post n. For each pair (i,j) with 1i