$[10$ points$]$ Given an array of integers A$[1...$ n$],$ we need to push all square num$-$

bers in the array to the front of the array and the non$-$square numbers to the

end. Assume that you are given a function ISPERFECTSQUARE$($k$)$ that checks if

a given number k is a square number or not in O$(1)$ time.

$($i$)$ Design a O n$2$ time, O$(1)$ extra space algorithm GROUPING$-$NAIVE$($A$[1...$ n$])$ to

solve the problem.