Problem: On an ARM processor using big endian format, given the following memory map and [R1] = 0xA10E0C2D, [R2] = 0x00000060, [R3] = 0x00000002, [R4] = 0x0000000C, predict [R1] and [R2] and draw the updated memory map after an ARM data transfer instruction is executed in EACH case. (hint: (1) in this map, each memory location is a word long and occupies 4 bytes; also you only need to draw the section of the memory including the changed word and its address; (2) these instructions are NOT executed one after the other one; instead, each instruction starts with the initial conditions given in the statement.)

0x6C [0x78092A7B]

0x68 [0x56AB8CEF]

0x64 [0x3490AB02]

0x60 [0x902E8C9A]

(a) LDRSB R1, [R2]

(b) LDRSH R1, [R2, #4]

(c) STRH R1, [R2, #4]!

(d) LDR R1, [R2], #0x4

(e) STR R1, [R2, R3, LSL #2]

(f) LDRB R1, [R2]

(g) LDRH R1, [R2, R4]

(h) STRB R1, [R2]