Consider an nXn grid of 1X1 squares where the bottom left corner square is at coordinates (1,1) and the top right corner square is at coordinates (n, n). You start from (1,1) and must reach (n, n) by either moving to the right or to the top by one unit. For each square the corr. costs of moving up c(i, j, i 1,j) and moving to the right c(i, j, i, j 1) are given (if the move is valid). How do you compute the cheapest way to get to (n, n). What is your time complexity