In this section, you are given an array of nodes and your task is to transform them. The only catch is that the transformation must be done within a loop. In other words You are not allowed to write anything outside the body of your loop.

The structure of your solution should be in the following form.

C$++$ code

Node solution $($Node$*$ input, int size$)$

$\{$

for $($int i$=0$; i $$ size; i$+=1)$

$\{$

$//$your code goes here

$\}$

return input$[0]$;

$\}$

Hint: there is a pattern to the transformation and in some instances you might want to use Mod to return back to zero after you increase to a certain number. I guess you can call it a roll over of sort

Here is the shape you are supposed to transform the list into