Minimum Path Sum

Problem: Minimum Path Sum You are given an m x n grid whose entries are non-negative integers. Determine the path from the upper-left cell to the lower-right cell with the smallest possible sum of visited values. At every step, movement is restricted to either the cell immediately below or the cell immediately to the right. Input Format The first line provides two integers, m and n. Each of the following m lines contains n non-negative integers describing grid. Output Format…