How do we do this

Let Q be a queue of n integers. Describe an algorithm that takes the queue, and possibly a stack or another queue, and moves all the negative numbers to the front of the queue, with the rest of the numbers following behind. The relative ordering of the negative and non-negative numbers should not change. [O-12-34-56-789] the output should be the following queue [-1-3-5-70 2 4 6 8 91 Assume you can query the queue and the stack sizes, or check if they are empty. Provide a pseudo code of a method that accomplishes this (or a flowchart, or an informal description of the algorithm in plain English)