Given an array A$[1...$ n$]$ where n $>=2$ containing integers from $1$ to n$1$

inclusive, exactly one of which is repeated, we need to find and return this integer

that is repeated.

$($i$)$ Design a O$($n$^2)$

time algorithm FINDREPEATEDNUMBER$-$NAIVE$($A$[1...$ n$])$ to

solve the problem.

$($ii$)$ Design a O $($n$)$ time constant extra space algorithm FINDREPEATEDNUMBEREFFICIENT$($A$[1...$ n$])$ to solve the problem.