case 2: Consider the following statements: (4, 10) if (!stack.isEmptyStack()) linkedStackType stack; linkedQueueType queue; int num; cout « stack.top () << " "; stack.pop (); else if (!queue.isEmptyQueue ()) Suppose the input is: cout « queue.front () <« " "; queue.deleteQueue () ; 48 35 72 88 92 11 10 15 44 52 67 36 Show what is written by the following segment of code: else stack.push(0); queue.addQueue (0); cin >> num; cout « "Stack and queue are empty." << endl; break; } //end switch while (cin) cin >> num; } //end while switch (num % 3) cout « endl; cout « "stack: "; while (!stack.isEmptyStack ()) case 0: stack.push (num); break; case 1: queue.addQueue (num); break; cout « stack.top () « " "; stack.pop (); cout « endl; cout « "queue: "; while (!queue.isEmptyQueue ()) cout « queue.front () <« " "; queue.deleteQueue () ; cout « endl; 48 72 0 15 stack: 36 queue: 0 88 10 52 67 48 73 0 15 stack: 37 queue: 0 88 10 52 67 O 48 74 0 15 stack: 38 queue: 0 88 10 52 67 48 75 0 15 stack: 39 queue: 0 88 10 52 67

Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode!=NULL){      a+=curNode->getItem();       curNode=curNode->getNext();       if(curNode!=NULL)            curNode=curNode->getNext(); } A.32 B.43 C.19 D.18

Consider the following statements: stackType<int> stack; int x; Suppose that the input is: 14 53 34 32 13 5 -999 Show what is output by the following segment of code: cin >> x; while (x != -999) { if (x % 2 == 0) { if (!stack.isFullStack()) stack.push(x); } else cout << "x = " << x << endl; cin >> x; } cout << "Stack Elements: "; while (!stack.isEmptyStack()) { cout << " " << stack.top(); stack.pop(); } cout << endl;

Project Overview: This project is for testing the use and understanding of stacks. In this assignment, you will be writing a program that reads in a stream of text and tests for mismatched delimiters. First, you will create a stack class that stores, in each node, a character (char), a line number (int) and a character count (int). This can either be based on a dynamic stack or a static stack from the book, modified according to these requirements. I suggest using a stack of structs that have the char, line number and character count as members, but you can do this separately if you wish.Second, your program should start reading in lines of text from the user. This reading in of lines of text (using getline) should only end when it receives the line “DONE”.While the text is being read, you will use this stack to test for matching “blocks”. That is, the text coming in will have the delimiters to bracket information into blocks, the braces {}, parentheses (), and brackets [ ]. A string…