Determine for the following code how many pages are transferred between disk and main memory, assuming each page has 2000 words, the active memory set size is 1000 (at any time no more than 1000 pages may be in main memory) and the replacement strategy is LRU (least recent used page is always replaced) also assume that all 2D arrays are of size (1:2000, 1:2000) with each array element occupying one word, N=2000

for I := 1 to 2000 do

for J := 1 to 2000 do

{ A[I,J] := A[I,J]*B[I,J] ; B[I,J] := C[N-I+1, J] * B[I,J] }

Provided the array are mapped into the main memory space

A) in row-major order

B) in column-major order