Write a program that references all locations in a large two$-$dimensional array. Compare the execution times when the program iterates through rows and touches each column with a row to the time required when the program iterates through all columns and touches each row with a column. $(9$ pts$)$

For example, there is a large array of characters A$[$N$,$M$],$

for $($i $=1$ to N $\{$

for j $=1$ to m$\{$

A$[$i$,$j$]=0$

$\}$

$\}$

and

for $($ij$=1$ to M $\{$

for i$=1$ to N$\{$

A$[$i$,$j$]=0$

$\}$

$\}$