Data structure 16

) Stack (10 marks) a) This question is about the implementation of a stack. Fill in the missing entries. Note that a missing entry can be a variable, a function call, a parameter, a program statement, etc. void stack push(stack t s, int x)i node *newtop - malloc(sizeof(node)); newtop->e - x; newtop->next (i)_; (iinewtop; void stack_pop(stack_t s){ node *t - s->next; if (t != NULL){ s->next - (iii) free( (iv) ); b) What is a disadvantage when a stack is implemented by an array instead of a linked-list