I was wondering if anybody out there could help me on this, I need to create a priority queue, more specifically I need help on the dequeue method. For this, I need to remove the object with the highest priority and return it, but if more than one object of identical priority exists, then the object that has been in the queue longest must be...