Priority Queue Implementation:
Write your own implementation of a priority queue of integers: a priority queue maintains its elements sorted. The operations that you need to provide are inserting an integer, removing an integer, checking if a given integer is already contained in the queue. Duplicate elements are permitted. Do not use any of the predefined collections from the Java libraries.
Provide a test program that inserts random values into two priority queues (one instance of your implementation, and one instance of the java.util.PriorityQueue). Measure the runtime performance for 10000, 20000, ... up to 100000 insertions.
Deliverables are your class implementation and your test program, and a document describing your design and your results (no more than 2 pages).