Recursion and Dynamic Programming - Minimum Path Sum of Matrix

Give you a two-dimensional array, each number in the two-dimensional array is a positive number, and it is required to go from the upper left corner to the lower right corner, and each step can only be right or down. The numbers passed along the way are added up. Returns the smallest path sum.