Thumb up for the solution, thx !

I.I 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)f node *newtopmalloc(sizeof(node)); newtop->next (i) (iinewtop; void stack_pop(stack t s){ node *t - s->next; if (t != NULL){ s->next(iii) free( (iv)); 1 .2 What is a disadvantage when a stack is implemented by an array instead of a linked-list? 1 .3 Write the postfix expression for the following infix expressions. (i) a*b+c/d (ii) a+b*c/d (ii) a/b-ctd*e (iv) (a+b) dte/ (f+a*d) +a