$2\mathrm{.}2[$E$]$ Consider a computer that has a byte$-$addressable memory organized in $32-$bit words ac$-$

cording to the big$-$endian scheme. A program reads ASCII characters entered at a keyboard

and stores them in successive byte locations, starting at location $1000.$ Show the contents

of the two memory words at locations $1000$ and $1004$ after the word "Computer" has been

entered.

$2\mathrm{.}3[$E$]$ Repeat Problem $2\mathrm{.}2$ for the little$-$endian scheme. $($Please help with $2\mathrm{.}3$ only$)$