2. (10 pts) The following table shows a portion of the memory of a computer. All numbers in the table are in hexadecimal. (a) What is the result of the following instructions if the computer is a little endian machine? Assume X0=0x52000040 at the beginning ADDI X2, X31, #16 LSR X3, X2, #2 ADD XO, X3, X31 LDUR X5, [X0, #4] i.e., X5 = Address Ox52000040 Ox52000041 0x52000042 Ox52000043 Ox52000044 Ox52000045 Ox52000046 Ox52000047 Ox52000048 0x52000049 0x5200004A Ox5200004B 0x5200004C 0x5200004D Ox5200004E 0x5200004F Ox52000050 Ox52000051 Ox52000052 Ox52000053 Contents 12 23 34 FF 56 67 78 89 DD CC AA C9 38 40 40 AE 33 FF 01 FE (b) Show on the left memory map the result of the following instructions assuming big endian computer, where $X20=0x52000050 and X1 = 0x12345678FFE5AB70. In order words, the contents of which memory locations will be changed to what values after the following two instructions are executed. SUBI X2, X2, #8 STUR X1. [X2 #-4]