Q$2($Recursive Thinking $2)$:

Write a function recursiveMax$($int$[]$ arr$),$ that returns the maximum value in the

array, by calling itself recursively twice $($java$).$

$($Note: In your own free time, you should also try to write the same function by

calling itself only once $$ and this one is easier than the given question$).$