$3$

$8\mathrm{.}1$ Suppose we are compiling for a machine with $1-$byte characters, $2-$byte shorts, $4-$byte integers, and $8-$byte reals, and with alignment rules that re$-$ quire the address of every primitive data element to be an even multiple of the element's size. Suppose further that the compiler is not permitted to reorder fields. How much space will be consumed by the following array? Explain.

A : array $[0.\mathrm{.}9]$ of record

s : short

c : char

t : short d : char

$r$ :real

i : integer