For the struct defined below, show how a smart compiler might pack the data to minimize wasted space and follow alignment restrictions. Pack in such a way that each member is naturally aligned based on its data type. Assume the compiler will not reorder fields of the struct in memory. Assume a char is 1 byte, int is 4 bytes, and a short is 2 bytes. Moreover, assume the CPU architecture is little-endian and its granularity supports load word (LW), load byte (LB), and load half word (LHW), where a memory word is 4 bytes. struct{inta;charb;intc;shortd;shorte[2];s//a=011001100//b=041//c=012345678//d=06164//e={08765,04321} (i) Fill in the bytes ( 5 points) (ii) CPU issues: LW R1, MEM[0x100C]. Show the content of R1. (2 points) (iii) You are a clever programmer who knows the architectural details and how the compiler will pack the variables to optimize on space. Reorder the elements of st ruct x such that it will result in optimal space usage. ( 3 points) For the struct defined below, show how a smart compiler might pack the data to minimize wasted space and follow alignment restrictions. Pack in such a way that each member is naturally aligned based on its data type. Assume the compiler will not reorder fields of the struct in memory. Assume a char is 1 byte, int is 4 bytes, and a short is 2 bytes. Moreover, assume the CPU architecture is little-endian and its granularity supports load word (LW), load byte (LB), and load half word (LHW), where a memory word is 4 bytes. struct{inta;charb;intc;shortd;shorte[2];s//a=011001100//b=041//c=012345678//d=06164//e={08765,04321} (i) Fill in the bytes ( 5 points) (ii) CPU issues: LW R1, MEM[0x100C]. Show the content of R1. (2 points) (iii) You are a clever programmer who knows the architectural details and how the compiler will pack the variables to optimize on space. Reorder the elements of st ruct x such that it will result in optimal space usage. ( 3 points)