Provide a generic Java class named SortedPriorityQueue that implements a priority queue using a sorted list implemented with the Java ArrayList class. Make the implementation as efficient as possible.

Example for unsorted list:

class UnsortedPriorityQueue

{

private ArrayList queue = new ArrayList();

public void add(T element)

{

queue.add(element);

}

public T remove()

{

int largestIndex = 0;

for (int i = 1; i < queue.size(); i++)

if (queue.get(largestIndex).compareTo(queue.get(i)) < 0)

largestIndex = i;

T largestValue = queue.get(largestIndex);

if (largestIndex == queue.size()-1)

queue.remove(largestIndex);

else

queue.set(largestIndex, queue.remove(queue.size() - 1));

return largestValue;

}

}