Consider the following two-dimensional array A: var A: array[1..100][1..100] of integer; where A[1][1] is at location 200, in a paged memory system with pages of size 200 words. A small process is in page 0 (locations 0 to 199) for manipulating the matrix; thus every instruction fetch will be from page 0. For three page frames, how many page faults are generated by the following array-initialization loops, using LRU replacement, assuming each integer requires one word of storage, twodimensional arrays are stored in row-major order, and page 0 already has the process in it with the other two pages initially empty: 1. for j := 1 to 100 do for i := 1 to 100 do A[i][j] := 0; 2. for i := 1 to 100 do for j := 1 to 100 do A[i][j] := 0;