Fill in blank #3:

A. stack->info

B. itemPtr->next

C. stack->next

D. itemPtr->info

E. answer not shown

struct NodeType: struct NodeType ItemType info: typedefNodeType NodePtr NodePtr next: class StackType class QueType public: public: // prototypes go here //prototypes go here private: private: NodePtr stack: NodePtr front: NodePtr rear: StackType: :StackType ) Pre: none Post: stack has been created. Boolean QueType: :IsEmpty //Pre: queue has been created. //Post: returns true if queue is empty:false. otherwise retur 15 void StackType: :Push(ItenType item) /Pre: stack is not full //Post: item is on the stack void QueType: :Deque (ItemType&item) //Pre: queue is not empty //Post: iten with the longest time NodePtr itemPtr: : 112 13 on the queue is removed item ; stack: NodePtr tempPtr: tempPtr- tem ront_ if ( stack = tenPtr. /6 rearNULL delete