Consider The Following Recursive Implementationp Pre Langc #2036

 #include<stdio.h> #include<limits.h> int min_jumps(int *arr, int strt, int end) { int idx; if(strt == end) return 0; if(arr[strt] == 0) // jump cannot be made return INT_MAX; int min = INT_MAX; for(idx = 1; idx <= arr[strt] && strt + idx <= end; idx++) { int jumps = min_jumps(____,____,____) + 1; if(jumps < min) min  = jumps; } return min; } int main() { int arr[] ={1, 3, 5, 8, 9, 2, 6, 7, 6},len = 9; int ans = min_jumps(arr, 0, len-1); printf("%d\n",ans); return 0; }