a. Complete the following method reverseQ, which takes only Q as a Que Type parameter and declares a StackType S and an ItemType item locally. The reverseQ method should use the S and item only to reverse the order of the items in its parameter, Q (you are restricted to use any other data structure in reverseQ). Finally, what will be the time-complexity of reverseQ method (after your implementation)? | void reverse Q (Que Type Q) 2 { Stack Type S; Item Type item; 4 5 6 // Your code goes here b. Consider the following operations performed on a stack of size 5. Push(1); Pop(); Push(2); Push(3); Pop(); Push(4); Pop(); PopO; Push(5); After the completion of all operation, what will be the number of elements present in the stack