We Sometimes See A Stack Implemented With A Sentinel Node Which Does Not Hold Actual Data But Is Used To Locate The Top Of The Stack. Write The Necessary Methods To Complete The Program. For Marking Purposes, Push 1, 2, 3, And 4 Onto The Stack, Write The Stack To The File, Pop Twice And Write To The File. Declaration Of Class StackSentinel /

stack to out /. A stack looks like a chain of nodes 0 Text > Feat next => NULL bottom of sentinel is an object which acts marker for the top of the stack sentinel.net points to the top of the stack which will be NULL the stack is empty. The value stored in sentinel. data is not part of the stack so we can put any walue there. The value at the top of the stack is sentinel.Rat->data- #endif /. STACKSENTINELN / Implementation of Class StackSentinel / File stacksentinel.cpp Implementation of class StackSentinel #include \"stacksentinel.h\" node 11 node(int x) next = NULL; /: the push function takes an Cristing stack 101 data data data -> next | rent - -> NULL sentinel bottom stack of ptr points to a new node object > next Next--> NULL Inext- Sentinel -> NULL topo and pick all the first nede object to returst's data O t e E connect this new node into the list data data net -->NULL w top old top bottom /. The pop function takes an existing stack data data data rent rert - > ... next -->NULL sentinel bottom of stack and picks of the first mode

StackSentinel Programmer: your name Date: #include \"stacksentinel.h\" int main(void) stack mystack ofstream fout (stacksentinelout.txt\"): charch: int X cout ;>> eh : if (chp ') cout > mystack.push(x): \": else if (cho ') i mystack.mpty()) cout \"data>> ch; if (ch