Consider the following sorting algorithm that uses the class you wrote in the previous

problem:

void sort$($int$[]$ array$)$

$\{$

SortedPriorityQueue queue $=$ new SortedPriorityQueue$(100)$;

for $($int i $=0$; i $<$ array.length; i$++)$

queue.add$($array$[$i$])$;

for $($int i $=0$; i $<$ array.length; i$++)$

array$[$i$]=$ queue.remove$()$;

$\}$

Analyze its execution time efficiency in the worst case. In your analysis you may ignore

the possibility that the array may overflow. Indicate whether this implementation is more

or less efficient than the one that uses the Java priority queue.