code in C Figure $7\mathrm{.}13$ in the textbook $($slide $34/$ lesson $07$ of the generic slides$)$ shows the two functions pop and push that deal with a stack of characters. Write the program by completing the main program that does the following:

Call the push function three times.

Prints out the updated stack

Calls the pop function once

Print the updated stack again.

No need to write the algorithm for this problem, it is already given to you.

#include

#define STACK$\_$EMPTY $\text{'}0\text{'}$

#define STACK$\_$SIZE $20$

void

push$($char stack$[],/*$ input$/$output $-$ the stack $*/$

char item, $/*$ input $-$ data being pushed onto the stack $*/$

int $*$top$,/*$ input$/$output $-$ pointer to top of stack $*/$

int max$\_$size$)/*$ input $-$ maximum size of stack $*/$

$\{$

if $(*$top $<$ max$\_$size$-1)\{$

$++(*$top$)$;

stack$[*$top$]=$ item;

$\}$

$\}$

char

pop $($char stack$[],/*$ input$/$output $-$ the stack $*/$

int $*$top$)/*$ input$/$output $-$ pointer to top of stack $*/$

$\{$

char item; $/*$ value popped off the stack $*/$

if $(*$top $>=0)\{$

item $=$ stack$[*$top$]$;

$--(*$top$)$;

$\}$ else $\{$

item $=$ STACK$\_$EMPTY;

$\}$

return $($item$)$;

$\}$

int

main $($void$)$

$\{$

char s $[$STACK$\_$SIZE$]$;

int s$\_$top $=-1$; $//$ stack is empty

$/*$ complete the program here $*/$

return $(0)$;

$\}$