Queues and Stacks:

Write a method called isConsecutive() that takes a stackof integers as a parameterand that returns whether or not the stack contains a sequence of consecutive integers starting from the bottom of the stack (returning true if it does, false if it does not). Consecutive integers are integers that come one after the other as in 5, 6, 7, 8, 9,etc... So if a stack sstores the following values:

bottom [3, 4,5, 6, 7, 8, 9, 10] top

the following call:

isConsecutive(s);

should return true.

If the stack had instead contained this set of values:

bottom[3, 4, 5, 6, 7, 8, 9, 10, 12] top

then the call should return false because 10 and12 are not consecutive. Notice thatwe look at the numbers starting at the bottom of the stack. The following sequence of values would be consecutive except for the fact that it appears in reverse order so the method should return false:

bottom [3, 2, 1] top

Your method must restore the stack so that it stores the same sequence of values after the call as it did before. Any stack with fewer than two values should be considered to be a list of consecutive integers. You are to use one queueas auxiliary storage to solve this problem.You may not use peek() or any iterators.