Consider the following operations performed on a stack of size 5 : Push (a); Pop() ; Push(b); Push(c); Pop(); Push(d); Pop();Pop(); Push (e) Which of the following statements is correct? None of the above Stack operations are performed smoothly Underflow occurs Overflow occurs What will be the output of the following C++ code? int main() \{ int sum =0; list mylist {1,5,6,3,9,2}; while (!mylist.empty()) \{ sum = sum + mylist.front () ; mylist.pop_front(); \} cout sum; return 0 ; \} 2 26 0 1 Max priority queue is based on max heap. True False What output is displayed after the following segment of code executes: stack s; int a =22,b=44 s.push(2); s.push(a); s.push(a + b); b = s.top(); s.pop(); s.push(b); s.push(a - b); s.pop(); while (!s.empty()) \{cout