Consider the following pseudo assembly code for computing $c=a+b.$ Assume that

$a,b,$ and c are assigned to consecutive mentory "words" $($memory is generalify

addressed byte by byte and assume that a word is $4$ bytes$)$ and address for $"a"$ is

$00000ec00.$ A so$,$ we have $a=24,b=110,$ and $c=10$ at the starting time. Assume

that the first instruction of the code is stored in $0$x$00006738.$ Also, each instruction has

the opcode in the first byte $($most significant byte$)$ and the remaining $3$ bytes specify

the correspond ng address, The opcode for store is $5,$ load is $4,$ and add is $6.$

$000006938$ load a

Ox$0000013$c add b

Or$0000$b$140$ store c

a$.$ Show the menory addresses and contents for all the instructions and data involved.

Use the format as follows to express your answer fut the foliowing is not the answer$).$

For a cata, use hexadecimal representat on $[$ Marks$]$

$2$nit

Addresses conterts

Ox$00$c$021040600000Cl$

Ox$000021080$x $00000002$

b$.$ Write the micro structions for the code segment. Assume that current PC

$($program counter$)$ is $0$ ro$000$b $138.$ For each micro$-$mstruction, also indicate the data

that is translerred of a is a merrory access$),$ For all data, use the hexadecimal

representation. The following wrethe finst two micro wintructions and the data

transtered Comp ele the rest Marks$]$

MetsiOndar Asoesument $620$et $2031$