Order of Memory Access ~~~~~~~~~~~~~~~~~~~~~~ Below are several memory layouts of A$/$B elements to consider. $-------------------------------------------------------------------------$ Byte Offset $+00+04+08+12+16+80+84+88+92+96$ LAYOUT$1$ A$0$ A$1$ A$2$ A$3$ A$4...$ B$0$ B$1$ B$2$ B$3$ B$4...--------------------------------------------------------------------------------------------------------------------------------------------$ Byte Offset $+00+04+08+12+16+20+24+2832+36$ LAYOUT $2$ A$0$ B$0$ A$1$ B$1$ A$2$ B$2$ A$3$ B$3$ A$4$ B$4...-------------------------------------------------------------------$ For each of following, indicate the best suited option. The $`$int$\_$field$\_$base' approach code that is timed.. $-()$ Uses memory LAYOUT $1$ and visit elements in the order A$0,$ B$0,$ A$1,$ B$1,$ A$2,$ B$2,$ etc. $-($X$)$ Uses memory LAYOUT $1$ and visit elements in the order A$0,$ A$1,$ A$2,...$ B$0,$ B$1,$ B$2,$ etc. $-()$ Uses memory LAYOUT $2$ and visit elements in the order A$0,$ B$0,$ A$1,$ B$1,$ A$2,$ B$2,$ etc. $-()$ Uses memory LAYOUT $2$ and visit elements in the order A$0,$ A$1,$ A$2,...$ B$0,$ B$1,$ B$2,$ etc. The $`$arr$\_$field$\_$base' approach code that is timed.. $-()$ Uses memory LAYOUT $1$ and visit elements in the order A$0,$ B$0,$ A$1,$ B$1,$ A$2,$ B$2,$ etc. $-($X$)$ Uses memory LAYOUT $1$ and visit elements in the order A$0,$ A$1,$ A$2,...$ B$0,$ B$1,$ B$2,$ etc. $-()$ Uses memory LAYOUT $2$ and visit elements in the order A$0,$ B$0,$ A$1,$ B$1,$ A$2,$ B$2,$ etc. $-()$ Uses memory LAYOUT $2$ and visit elements in the order A$0,$ A$1,$ A$2,...$ B$0,$ B$1,$ B$2,$ etc. The $`$int$\_$field$\_$optm' approach code that is timed.. $-()$ Uses memory LAYOUT $1$ and visit elements in the order A$0,$ B$0,$ A$1,$ B$1,$ A$2,$ B$2,$ etc. $-()$ Uses memory LAYOUT $1$ and visit elements in the order A$0,$ A$1,$ A$2,...$ B$0,$ B$1,$ B$2,$ etc. $-($X$)$ Uses memory LAYOUT $2$ and visit elements in the order A$0,$ B$0,$ A$1,$ B$1,$ A$2,$ B$2,$ etc. $-()$ Uses memory LAYOUT $2$ and visit elements in the order A$0,$ A$1,$ A$2,...$ B$0,$ B$1,$ B$2,$ etc. The $`$arr$\_$field$\_$optm' approach code that is timed.. $-($X$)$ Uses memory LAYOUT $1$ and visit elements in the order A$0,$ B$0,$ A$1,$ B$1,$ A$2,$ B$2,$ etc. $-()$ Uses memory LAYOUT $1$ and visit elements in the order A$0,$ A$1,$ A$2,...$ B$0,$ B$1,$ B$2,$ etc. $-()$ Uses memory LAYOUT $2$ and visit elements in the order A$0,$ B$0,$ A$1,$ B$1,$ A$2,$ B$2,$ etc. $-()$ Uses memory LAYOUT $2$ and visit elements in the order A$0,$ A$1,$ A$2,...$ B$0,$ B$1,$ B$2,$ etc. Solve the above questions using the code below as reference: #include #include #include typedef struct $\{//$ fields are individual ints int a; int b; $\}$ int$\_$field$\_$t; typedef struct $\{//$ fields are arrays of ints int $*$a$\_$arr; int $*$b$\_$arr; $\}$ arr$\_$field$\_$t; $//$ Use this format string for printf$()$ invocations so that the output $//$ identical for each timing run const char $*$FORMAT $=$ "method: $\%14$s CPU time: $\%\mathrm{.}4$e sec sum: $\%$d

$"$; $//||+->$ sum computed in loop, should be $0$ each time $//|+->$ CPU time computed over nested summing loops $//+->$ string describing one of the methods used to print; $//$ One of: "int$\_$field$\_$base" "arr$\_$field$\_$base" $//$ "int$\_$field$\_$optm" "arr$\_$field$\_$optm" $////$ Example: printf$($FORMAT$,$ "int$\_$field$\_$optm", some$\_$time, total$)$; int main$($int argc, char $*$argv$[])\{$ if$($argc $<3)\{$ printf$("$usage: $\%$s

$",$argv$[0])$; return $1$; $\}$ int length $=$ atoi$($argv$[1])$; int max$\_$iter $=$ atoi$($argv$[2])$; clock$\_$t begin, end; $//$ Variables for timing double cpu$\_$time; int suma,sumb; $//$ sum of elements in structs $//////////////////////////////////////////////////////////////////////////////////$ int$\_$field$\_$base approach int$\_$field$\_$t $*$int$\_$field$\_$arr$1=//$ allocate$/$initialize int$\_$field array malloc$($sizeof$($int$\_$field$\_$t$)*$length$)$; for$($int i$=0$; i