Please do this in little endian order!

Consider a computer 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 successive byte locations, starting at address 500. Show the contents of the two memory words at addresses 504 and 508 after the characters "Computer#ece@OSU" have been entered. 1. Repeat this problem for the little-endian scheme. (16pt, 4pt each)