Reversing the Sub Queue

You are given a QUEUE containing ‘N’ integers and an integer ‘K’. You need to reverse the order of the first ‘K’ elements of the queue, leaving the other elements in the same relative order. You can only use the standard operations of the QUEUE STL : 1. enqueue(x) : Adds an item x to rear of the queue 2. dequeue() : Removes an item from front of the queue 3. size() : Returns number of elements in