Question 8: There are N stones, numbered 1, 2, \ldots, N. For each (1…

There are $N$ stones, numbered $1, 2, \ldots, N$. For each $(1 \leqslant i \leqslant N)$, the height of stone $i$ is $h_i$. Assume these heights are stored in an array $H$. We are also given an additional parameter $K \leqslant N-1$ which denotes the maximum jump length.

There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone $N$:

• If the frog is currently on Stone $i$, jump to one of the following: Stone $i+1, i+2, \ldots, i+K$.
• Here, a cost of $|h_i - h_j|$ is incurred, where $j$ is the stone to land on.

Our goal is to find the minimum possible total cost incurred before the frog reaches Stone $N$.

Based on the above data, answer the given subquestions.

Consider the following program that attempts to solve this problem.

For all $1 \leqslant i \leqslant N$, define dp[i] as the minimum cost we can achieve to reach stone i. We set dp[0] = 0 and dp[i] to infinity for all $1 \leqslant i \leqslant N-1$.

We then propose to populate dp according to the code below.

Which of the following statements is true about the code snippet above? Select all that apply.