(Abstract Data Type) Consider the data structure for the stack ADT typedef struct node 6. int n; struct node *next; Node; struct stackHead [ Node *head: typedef stackHead *Stack; 1. Stack si s-create) 3. push (s, 1) For functions create and push, refer to their pseudocode in lecture notes After EACH statement (1 to 3) above, draw a diagram of all memory relevant to s. If the content in the relevant memory unit is unknown, put "?" inside the unit, otherwise, put the right information there. As for pointers/memory addresses, you can either make up some addresses or use an arrow (as we did in class) to indicate their values