In a grid with m rows and n columns, each location has a positive integer value c ij which indicates the cost of entering the location at the ith row...

In a grid with m rows and n columns, each location has a positive integer value cij which indicates the cost of entering the location at the ith row and jth column. In the grid, you can move up, down, left, or right to the location that is adjacent to your current location. We start from the top-left location (with cost c11 = 0) and we want to move to the bottom-right location (which has some cost cmn). Design an efficient algorithm to find the minimum cost to reach the bottom-right location, and analyze the runtime of your algorithm.