Java please

Each square of the following 10 x 10 checkerboard has a toll associated with it that must be paid when you enter the square. You wish to travel from the bottom-most row to the topmost row and minimize the total of the tolls along the way. Write a program to output the row and column numbers of a route that minimizes the tolls. When making a move, the row number must increase by 1 and the column number can change by -1, 0, or +1. Tolls range from 0 to 9, and row 1 and column 1 is the lower leftmost square of the checkerboard. The program should invoke a dynamic recursive method, min Toll, to determine the minimum toll to get to each of the top row cells, i = 10, of the checkerboard calculated as minToll[1]j] = toll[G] + minimum of (minToll[i - 1]j - 1], minToll[i - 1]GI, minToll[i 1]j + 1]) Column 1 2 3 4 5 6 7 8 9 10 10 6 4 7 | 3 | 6 | 7 | 2 O | 6 | 1 7 8 2 | 3 5 + - 83 8 ??? EP "PO" | |-- ------ + -- w Eur un 7 o 4 24 3 Row 1 Owl0 | 5 6 | 1 27 Each square of the following 10 x 10 checkerboard has a toll associated with it that must be paid when you enter the square. You wish to travel from the bottom-most row to the topmost row and minimize the total of the tolls along the way. Write a program to output the row and column numbers of a route that minimizes the tolls. When making a move, the row number must increase by 1 and the column number can change by -1, 0, or +1. Tolls range from 0 to 9, and row 1 and column 1 is the lower leftmost square of the checkerboard. The program should invoke a dynamic recursive method, min Toll, to determine the minimum toll to get to each of the top row cells, i = 10, of the checkerboard calculated as minToll[1]j] = toll[G] + minimum of (minToll[i - 1]j - 1], minToll[i - 1]GI, minToll[i 1]j + 1]) Column 1 2 3 4 5 6 7 8 9 10 10 6 4 7 | 3 | 6 | 7 | 2 O | 6 | 1 7 8 2 | 3 5 + - 83 8 ??? EP "PO" | |-- ------ + -- w Eur un 7 o 4 24 3 Row 1 Owl0 | 5 6 | 1 27