Describe a memory-efficient solution to implement four queues in a single array. In other words, all four queues should use the same array for storing elements. The standard enqueue and dequeue methods should be updated to take an extra parameter to identify the queue. For example, the enqueue(n, element) method should add an element to queue number n, where n is an integer between 0 and 3. Similarly, the dequeue(n) method deletes an element from queue number “n” where n is from 0 to 3.

Describe a memory-efficient solution to implement four queues in a single array. In other words, all four queues should use the same array for storing elements. The standard enqueue and dequeue methods should be updated to take an extra parameter to identify the queue. For example, the enqueue(n, element) method should add an element to queue number n, where n is an integer between 0 and 3. Similarly, the dequeue(n) method deletes an element from queue number “n” where n is from 0 to 3.