120 points] 3. A perfect square is a number that can be expressed as the product of two equal integers The following algorithm finds all perfect squares in an input array A PERFECT_SQUARES (A) 1. SQUARES = {} 2. For each value, v1, in A: if isPerfectSquare (v1) 4 5. return SQUARES Add vi to SQUARES Notice that the efficiency of the algorithm will depend on the efficiency of the 1sPerfectsquare fu Assume we use an implementation of isPerfectSquare, which has a best case running time e 0(log n). What is the big-Oh running time of the PERFECT_sQUARES algorithm (1) and a w