Array Question

5. 16 points] Suppose we are compiling for a machine with 1-byte characters, 2-byte shorts, 4- every byte integers, and 8-byte reals, with alignment rules that require the address of primitive data element to be an even multiple of the element's size. Consider the following arrav: A array [0..9] of record s: short j: integer c: char d: real h: char f real t: short i: integer e: char a. Suppose that you cannot reorder fields. Show the layout of a single record in the above array. How much space will be consumed by the array? b. Suppose that you can reorder fields. Show the improved layout of the record that uses the least amount of space while obeying alignment rules. How much total space will be saved with this new layout for the entire array