Using the provided skeleton code, please write a c program that has the following output$//$Small stack implementation using linked list

#include

#include

#define EMPTY $-1//$assuming we will not have $-1$ in the stack

$//$ Struct used to form a stack of integers.

struct stack $\{$

int data;

struct stack $*$next;

$\}$;

int push$($struct stack $**$front$,$ int num$)$;

int pop$($struct stack $**$front$)$;

int empty$($struct stack $*$front$)$;

int top$($struct stack $*$front$)$;

void init$($struct stack $**$front$)$;

void printStack$($struct stack $*$front$)$;

int main$()\{$

int choice, data;

struct stack $*$stack$1$; $//$stack$1$ is the root of our stack

int tempval;

init$(\_\_\_\_\_\_\_\_\_\_\_)$; $//$call the init function appropriately

printf$("$Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $")$;

scanf$("\%$d$",$ &choice$)$;

while$($choice $!=4)$

$\{$

switch$($choice$)$

$\{$

case $1$:

printf$("$Enter data: $")$;

scanf$("\%$d$",$ &data$)$;

if$(!$push$($&stack$1,$ data$))$

printf$("$push failed

$")$;

else

printStack$($stack$1)$;

break; $//$break from case

case $2$:

data $=$ pop$($&stack$1)$;

if$($data $!=$ EMPTY$)$

$\{$

printf$("\%$d popped

$",$ data$)$;

printStack$($stack$1)$;

$\}$

else

printf$("$empty stack

$")$;

break;

case $3$:

printStack$($stack$1)$;

$\}$

printf$("$Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $")$;

scanf$("\%$d$",$ &choice$)$;

$\}$

return $0$;

$\}$

void init$($struct stack $**$front$)\{$

$//$ write the init functin to initialze the front to NULL

$\}$

void printStack$($struct stack $*$front$)$

$\{$

if$($front $==$ NULL$)$

printf$("$empty stack"$)$;

else

$\{$

printf$("$stack: $")$;

$//$write the loop to print the stack. Numbers should be printed in space

separated

while$(\_\_\_\_\_\_\_\_\_)$

$\{$

$//$ complete this part

$\}$

$\}$

printf$("$

$")$;

$\}$

$//$ Pre$-$condition: front points to the top of the stack.

$//$ Post$-$condition: a new node storing num will be pushed on top of the

$//$ stack if memory is available. In this case a $1$ is

$//$ returned. If no memory is found, no push is executed

$//$ and a $0$ is returned.

int push$($struct stack $**$front$,$ int num$)\{$

$//$complete the push function

$\}$

$//$ Pre$-$condition: front points to the top of a stack

$//$ Post$-$condition: Return the top $($front$)$ most data from the stack and

$//$ remove the current front and upate the front

$//$ return EMPTY if stack is empty.

int pop$($struct stack $**$front$)\{$

$//$complete the pop function

$\}$

$//$ Pre$-$condition: front points to the top of a stack

$//$ Post$-$condition: returns true if the stack is empty, false otherwise.

int empty$($struct stack $*$front$)\{$

if $($front $==$ NULL$)$

return $1$;

else

return $0$;

$\}$

$//$ Pre$-$condition: front points to the top of a stack

$//$ Post$-$condition: returns the value stored at the top of the stack if the

$//$ stack is non$-$empty, or $-1$ otherwise.

int peek$($struct stack $*$front$)\{$

if $($front $!=$ NULL$)\{$

return front$->$data;

$\}$

else

return $-1$;

$\}$Example input$/$output $($the red color texts are part of the input$)$:

Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $1$

Enter data: $50$

stack: $50$

Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $1$

Enter data: $40$

stack: $4050$

Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $1$

Enter data: $60$

stack: $604050$

Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $2$

$60$ popped

stack: $4050$

Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $2$

$40$ popped

stack: $50$

Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $2$

$50$ popped

empty stack

Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $2$

empty stack

Menu: $1.$ push $2.$ pop, $3.$ print $4.$ exit.

Enter your choice: $4$