Odd$-$Even$-$Transform Problem works on an array of integers $($both positive, negative and zero$),$ by taking in a value $($a whole number$)$ that specifies the number of times the transformation has to be applied

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

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

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

Example:

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

$[3,4,9]->[6,1,12]>[3\mathrm{.}4\mathrm{.}9]->[6\mathrm{.}1121$ So the result is $[6\mathrm{.}1\mathrm{.}12]$

Language

$19$

$20$

$21$

$22$

$23$

$24$

$25$

$26$

$27$

$28$

$29$

$30$

$31$

$32$

$33$

Function Description

Complete the function addEven Transform in the

editor below

oddEven Transform has the following parameter$($s$)$:

arr: an array of integers

ich$-$spe Whany transforma an integer which specifies how many times to perform transformation

The function needs to return the array after the transformation is complete...