For the struct defined below, show how a smart compiler might pack the data to follow natural alignment restrictions while minimizing wasted space as possible. Pack in such a way that each member is naturally aligned based on its data. The compiler will not reorder fields of the struct in memory. Memory is byte-addressable and a char is 1 byte, an int is 4 bytes, and a short is 2 bytes. The architecture is Big-endian and supports load word, load byte, and load half word instructions, where a memory word is 4 bytes. Presume an instance of our struct x named magic begins at memory address 01000. As a work area, the table below represents a memory diagram where each blank represents a byte of memory. The following questions will ask you what bytes of data will be present at various addresses of memory on a single row in this table. Answer with a hex number in the format 0xAB or type ? if unknown data is stored at that address; enter a space between each byte. Keep the order shown in the table below, that is, with +3 on the left and +0 on the right within a row. For example, if there were a fifth row (starting address 01010 ) with 037 stored in 01010 and no other known values, it should be submitted like