Consider the data structure for the stack ADT: typedef struct node {int n; struct node *next;} Node; struct stack Head {Node *head;}; typedef stack Head *Stack; Stack s; s = create (); push (s, 1); When you work on this problem, you should take yourself as the implementer of the stack ADT. For functions create and push, refer to their pseudocode in lecture notes. After EACH statement above, draw a picture of all memory related 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. After your pictures, what is the side effect of line 3 above over s and memory related to it