Question $7(1$ point$)$

Listen

Consider the following algorithm which takes as input an array $A$ of size $n.$ It first sorts the array and then counts the number of duplicate elements:Determine the complexity of this algorithm