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