Given a two-dimensional array A declared as follows: (8%) intA[100][100]; where cach integer occupies four bytes and A[0][0] is at location 1,600 in a paged memory system with pages of size 1,600 . A small process for manipulating the matrix resides in page 0 (locations 0 to 1,599 ); 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 and assuming that page frame 1 has the process in it. the other two are initially empty, and the array is stored in memory row by row