c++ data structures queue. write a function to remove the common items in the two queues and save the common items in a queue and return it Note: 1. solve it without using different data structures...

c++ data structures queue.

write a function to remove the common items in the two queues
and save the common items in a queue and return it
Note: 1. solve it without using different data structures such as array

there should be 2 qeues both should have random elements the random elements that are commons should be saved in a 3rd queue and it should be print and after that all the elements that are not the same in qeues 1 and 2 should be printed alone.

theout put should do

q1 random elements like 5 2 2 1 6

q2 random elements like 2 4 5 9 8 3

q3 will have the common items the common items in q1 and q2 is 2 5

and then return queue 1 and queue 2 but without the common elements.

like q1 will be 1 6

and q2 will be 4 9 8 3