Write a main function that creates two stacks of integer objects and a queue of integer objects. store the numbers −1, 15, 23, 44, 4, 99 in the first stack. the top of the stack should store 99. b. write a loop to get each number from the first stack and store it in the second stack and in the queue. c. write a second loop to remove a value from the second stack and from the queue and display each pair of values on a separate output line. continue until the data structures are empty. show the output.