. T or F? Problem14.c executed on a little endian machine. Hints (1) Endian-ness is easily determined by looking at how the bytes used to represent a multi-byte code are placed in memory: When the little end comes first (that is, when the least significant byte is assigned the lowest main memory address), then the machine is little endian; but, when the big end comes first (that is, when the most significant byte is assigned the lowest main memory address), then the machine is big endian. (2) The elements of the array x.CHAR[] in particular (and of the elements of all arrays in general) are stored contiguously (adjacently, touching, in contact) in ascending main memory locations; that is, &x.CHAR[0] < &x.CHAR[1] < &x.CHAR[2] < &x.CHAR[3] and (&x.CHAR[i]+1 == &x.CHAR[i+1]) for i [ 0,2 ]