Consider the two-dimensional array A:int A[][]=new int[100][100],Where int A[0][0] is at location 200, in a paged system with pages of size 200. 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 arrayinitialization loops, using LRU replacement, and assuming page frame 1 has the process in it, and the other two are initially empty:
a. for (int j=0;j<100;j++)
for (int i=0;i<100;i++)
A[i][j]=0;
b. Afor (int i=0;i<100;i++)
for (int j=0;j<100;j++)
A[i][j]=0;