Write a method called switchPairs that accepts a stack of integers as a parameter and swaps neighboring pairs of numbers starting at the bottom of the stack. For example, if the stack initially stores [1, 2, 8, 6, −1, 15, 7] , your method should swap the first pair (1, 2), the second pair (8, 6), the third pair (-1, 15), and so on. If the stack contains an odd number of elements, the element at the top should remain unmodified. So the final state of the stack would be [2, 1, 6, 8, 15, −1, 7] . Use one queue as auxiliary storage.