Stack as a linked list: Write a C++functions for pushing a value in the stack. void push (int value) Structure of the stack is declared as follows where top is the top of the stack struct node int value struct nodex next; // next element top nullptr Note: The pointer to top is declared above. There is a global stackCounter variable keeping track of number of elements in the stack. You need to update stackCounter properly at push and pop function If the stack is full print out "Overflowin" The helper functions and main program have already been defined. Write the function definition only for push The following functions/variables are already defined int maxSize; //Global variable which defines the maximum size of your stack bool isEmptyO://check if the stack is empty bool isFullO: // check if the stack is full int stackCounter; //the variable to be incremented/decremented based on push or pop void display0:I/ display the current stack. (It does not print out underflow or overflow which should be handled by your function). void pop0:1/ pop out from stack