Given a matrix ? (i.e., a 2D table) of positive integers of size
? × ?. A robot starts at the top- left position ?[?, ?] and must
reach the bottom-right position ?[?, ?]. From a position ?[?, ?],
the robot can only go either right to ?[?, ? + ?] or down to ?[? +
?, ?]. Let us define the cost of a path the total values of
integers in it. Find the least-cost path for the robot...