Problem $1(1$ pt$)$ Consider a program with the following struct and variables:

struct node $\{$

int data; $//4$ bytes

struct node $*$ link; $//4$ bytes

$\}$;

struct node $*$ head;

struct node $**$ ptr;

Assume that a struct node variable has its members stored in consecutive words in memory. $($Note: this may

not be true in real systems. In certain cases, the data alignment of the members may different, e$.$g$.,$ to

improve pipeline performance.$)$

Suppose after the running the program for a bit, the memory looks like the following, where variable $$head$$ is

at memory location $500.$

Address Contents Data Type Variable

$10004$ struct node

$10043000$

$5001000$ struct node $*$ head

$20007$ struct node

$20040$

$30009$ struct node

$30042000$

Next suppose the following instructions are executed. Answer the following questions

Instructions Questions

ptr $=$ &head; After the instruction, what is the value in ptr$?$

What is the value of $*$ptr$?$

What is the value of $(*$ptr$)->$data?

ptr $=$ &$((*$ptr$)->$link$)$ After the instruction, what is the value in ptr$?$

What is the value of $*$ptr$?$

What is the value of $(*$ptr$)->$link?