for recursion, find the minimum cost by crossing the board by choosing the path starting at 4 and ending at 30 (horizontally or vertically). Then adding the cost to each one then write the code for it

3 47 12 23 4 11 43 39 25 12 49 25 38 27 48 9 11 16 27 29 7 27 43 44 5 14 39 50 24 22 12 4 14 11 37 19 19 14 12 8 44 45 5 21 7 24 54 47 45 13 47 11 31 46 16 30 13 31 42 30 30 18 15 32