Let MyQueue represent a new data structure that has all the basic Queue operations as well as the following additional methods: peekFirst(): returns the first element peekSecond(): returns the second element swap(): swaps the first and second elements Describe an algorithm in pseudocode that takes a MyQueue object containing N elements and rearranges them so that they are in sorted order (sorted from smallest to largest.) You can use the basic comparison symbols: <, > ≤, ≥ to compare items. Analyze your algorithm’s runtime. Your extra space usage should be O(1), which means that in addition to the input MyQueue, you can only use variables (i. e. no extra arrays, queues, etc.).