1. Principle of Optimality (Dynamic Programming) Consider a grid world with m rows and n columns. In each grid [i,j] there are r(i,j) number of diamonds. There is a robot starting from the top left corner of this grid world, i.e. starting position 0,0]. The robot is limited to be able to move down and move right for one grid during each step. The only terminal or exist grid is the bottom right corner of this grid world, i.e. [m - 1,n ]. Please use principle of optimality (Bellman equation) to tell me how many diamonds in total that robot can collect. (1 point)