The stub of remove() should look like this: 
   Item LinkedQueue::remove() {
   }
The remove() method should behave as follows:
  1. If the queue is empty, throw an EmptyQueueException;
  2. Otherwise:
    1. Store the item in the oldest node (the one pointed to by myFirst) into local variable result;
    2. Save the address of the oldest node in a local variable nPtr;
    3. Make myFirst point at the next-oldest node in the queue (or NULL if there is none);
    4. Set the myNext member of the oldest node to NULL;
    5. Deallocate the oldest node;
    6. Subtract 1 from mySize; and
    7. Return result.