Queue ADT using two stacks. Use the Queue to solve the Josephus problem explained below. The Josephus problem is a famous problem in algorithm design. It can best be explained as the solution to one- potato-two-potato: Children sometimes choose which of them is to be given a prize by what they think is a random process: They stand in a circle and count, "1 potato, 2 potato, 3 potato, 4; 5 potato, 6 potato, 7 potato, more; Y- O-U spells you!". This is a count of 13 around the circle. Then they eliminate the child it ends on. This is repeated until only one child is left, which is the child who gets the prize.