Question 7. [8] Consider a system that has a byte-addressable memory organized in 32-bit words according to the big-endian scheme. A program reads ASCII characters entered at a keyboard and stores them in suc- cessive byte locations, starting at location 1000. (a)[4] Show the contents of the two memory words at locations 1000 and 1004 after the name "Johnson" has been entered. Label each byte precisely with its content and its address. character content in hex byte address 1000 1001 1002 1003 1004 1005 1006 1007 4 WORD @ 1000 LA WORD @ 1004 (b)[4] Repeat the question above for the little-endian scheme. character content in hex byte address 1000 1001 1002 1003 1004 1005 1006 1007 MADanu (b)[4] Repeat the question above for the little-endian scheme. character content in hex byte address 1000 1001 1002 1003 1004 1005 1006 1007 4 WORD @ 1000 WORD @ 1004