Minimum Steps to Target

You have a grid of size m x n, where each cell has a non-negative integer cost. You start from the top-left corner (0,0) and need to reach the bottom-right corner (m-1,n-1) while minimizing the total cost. Write a function to compute the minimum cost path to reach the target cell. Input Format: - The first line contains two integers, m and n (1 <= m, n <= 50). - The next m lines each contain n space-separated integers representing the costs in the grid. Output Format: - A single integer representing the minimum cost to reach the target cell. Example: Input: 2 2 1 3 2 1 Output: 3