Hi there! This is my first post so bare with me . I am currently working a question that involves recursion and its getting tough for me to wrap this one around my head.

The question: The game of “Jump It” consists of a board with n positive integers in a row except for the first column, which always contains zero. These numbers represent the cost to enter each column. Here is a sample game board where the length is 5:

0, 1, 3, 4, 1

The object of the game is to move from the first column to the last column in the lowest total cost. The number in each column represents the cost to enter that column. You always start the game in the first column and have two types of moves. You can either move to the adjacent column or jump over the adjacent column to land two columns over. The cost of a game is the sum of the costs of the visited columns.

In the case above the cheapest way would be to jump to index 2 (value 3) then jump to index 4 (value1) for a total cost =4

How can i recursively work through this problem to find the cheapest way no matter how large the game board is.