int sack. Let list be a 5(15 Points) Asa definition a circular list can be used to represent a stack. Let list pointer to the Last Node of a circular list and the First Node is the top of the sta Last Node Five Node Trace and show the contents of node structure, List the Output of the main program. struct sode Draw and show content of linked list structure 7 Points) stract node next; typedef struct node "NODEPTR: void push/NODEPTR 'stack, int): int pop/NODEPTR stack); int empty NODEPTR stack): List output of the main program(8 points) int main(void) int: NODEPTR list: list=NULL: for(int i = 3; i=0); void push(NODEPTR *stack, int x) NODEPTR P: pegetnode(://assume that this function is written p->info=x; if (empty(stack) = TRUE) *stack = p; else p->next =(*stack)->next; (stack)->next = p; return; int pop(NODEPTR *stack) NODEPTR p; if (empty(stack) == TRUE) { printf("Stack underflow ");return -1;} p=(*stack)->next; x=p->info: if (p= *stack) "stack = NULL; else (*stack)->next = p->next; free(p); return (x); int empty(NODEPTR *stack) { return ("stack ==NULL)? TRUE : FALSE);}