2. Determine for the following code how many pages are transferred between disk and main
memory, assuming each page has 5000 words, the active memory set size is 2000 (i. e., at
any time no more than 2000 pages may be in main memory), and the replacement strategy is
LRU (the Least Recently Used page is always replaced); also assume that all two-
dimensional arrays are of size (1:10000, 1:10000), with each array element occupying one
word, N=10000
for I := 1 to 10000 do
for J := 1 to 10000 do
{ A[I,J] := A[I,J] * B[I,J] ; B[I,J] := C[N-I+1,J] * A[I,J] }
provided the arrays are mapped into the main memory space
(a) in row-major order,
(b) in column-major order.
