Consider the following pseudo assembly code for computing c = a + b. Assume that a, b, and care assigned to consecutive memory “words” (memory is generally
addressed byte by byte and assume that a word is 4 bytes) and address for “ais,
00000ec00. Also, we have a = 22, b = 158, and c= 0 at the starting time. Assume
that the first instruction of the code is stored in 0x0000b128. Also, each instruction
has the opcode in the first byte (most significant byte) and the remaining 3 bytes
specify the coresponding addres. The opcode fr store i 1, load is 2 and add is

0x0000b128 load a
0x0000b12c add b
0x0000b130 store c