$($

a

$)$

$$You are given the following algorithm which accepts as input a list of positive integers

$$

$=$

$($

$$

$1$

$,$

dots,

$$

$$

$)$

$$and we need to determine whether all elements are unique

$($

that is

$,$

$$there are no repeated elements in the list

$)$

$.$

$$If all elements are unique, the algorithm outputs True, otherwise it will output False.

procedure CheckUnique

$($

$$

$,$

$$

$)$

for

$$

$=$

$1$

$$to

$$

$-$

$1$

$$do

for

$$

$=$

$$

$+$

$1$

$$to

$$

$$do

if

$$

$$

$=$

$+$

$-$

$$

$$

$$then

return FALSE

end if

end for

end for

return TRUE

end procedure

$($

i

$)$

$($

$3$

$$points

$)$

$$State the primitive operations and the data structure

$($

s

$)$

$$to be used in this algorithm.

$($

ii

$)$

$($

$2$

$$points

$)$

$$Compute the worst

$-$

case running time

$$

$($

$$

$)$

$$to output the final result using

$$

$-$

notation.