Update algorithms/graphs/min_cost_valid_path/README.md

Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>

Author: BrianLusina

algorithms/graphs/min_cost_valid_path/README.md

@@ -7,10 +7,10 @@
 Given an m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit if you are currently
 in this cell. The sign of grid[i][j] can be:
 
-- 1 which means go to the cell to the right. (i.e go from grid[i][j] to grid[i][j + 1])
-- 2 which means go to the cell to the left. (i.e go from grid[i][j] to grid[i][j - 1])
-- 3 which means go to the lower cell. (i.e go from grid[i][j] to grid[i + 1][j])
-- 4 which means go to the upper cell. (i.e go from grid[i][j] to grid[i - 1][j])
+- 1 which means go to the cell to the right. (i.e., go from `grid[i][j]` to `grid[i][j + 1]`)
+- 2 which means go to the cell to the left. (i.e., go from `grid[i][j]` to `grid[i][j - 1]`)
+- 3 which means go to the lower cell. (i.e., go from `grid[i][j]` to `grid[i + 1][j]`)
+- 4 which means go to the upper cell. (i.e., go from `grid[i][j]` to `grid[i - 1][j]`)
 
 > Notice that there could be some signs on the cells of the grid that point outside the grid.