Question $1$

Cdd$-$Even$-$Transform Problem works on an array of integers $($bath popitive, neginive. and zero$),$ by taking in a value $($a whole number$)$ that specifies the mumber of times the transformation has to be applied.

On an array of integers, the transformation that needs to occur, $n$ number of times:

$7$

Adds three $(+3)$ to each odd integer.

Subtracts three $(-3)$ from each even integer

Example:

$[3,4,9],3$ means, the array with integers $3,4,9$ has to undergo transformation $3$ times.

$[3,4,9]=>[6,1,12]=>[3,4,9]=>[6,1,12]$

So the resuit is $6,1,12$

Function Description

Complete the function oddEven Transform in the editor below. OddEvenTransform has the following parameter$($s$)$: arr: an array of integers