Assume that there exist m locations numbered 1 to m while you travel downstream. at any location i you can rent a boat to be returned at any of the downstream locations j > i. you are given a cost array cost(i, j) which provides the cost of these rentals for all 1≤i j). for example, the cost array with m= 4 might be the following: to jcost(i, j) 1 2 3 4 1 0 2 3 7from i 2 - 0 2 4 3 - - 0 2 4 - - - 0you need to find a dynamic programming algorithm that computes the cheapest sequence of rentals taking you from location 1 all the way down to location m.