there is a computer network consisting of nservers or nodes numbered from $1$ to n$1.$ Maximum Information

There is a computer network cortsisting of n servers, or nodes, numbered from $1$ to n$,$ and each node has a security value security$\_$val$[$i$].$ A hacker must choose a starting node, start Jumping through the network compromising servers along the way until reaching the end. From node x$,$ the hacker can jump to node $($x $+$ k$).$ If node $($x $+$ k$)$ does not exist, the jump is out of the network and the hack ends. Initially, the hacker has access to $0$ servers with $0$ security value. The security value at each compromised node is added to the hacker's security value sum, and values may be negative.

The task is to choose the starting node optimally such that the hacker compromises servers with the maximum possible security value sun. $2$

Example

Given, n $=5,$ security$\_$val $=[2,-3,4,6,1],$ and k $=2.$

Choose node index $=1$ as starting node

$2$

$-3$

$4$

$6$

$1$

$2+4+1=7$

The security value sum is security$\_$val$[1]+$ security$\_$val$[3]$ security$\_$val$[5]=2+4+1=7.$

Function Description

Complete the function gainMaxValue in the editor below. gainMaxValue has the following parameters:

int the values of each node