Consider the two-dimensional array A: int A [] [] = new int [100] [100]; where A [0] [0] is stored at location 200, in a paged memory system with pages of size 200. A small process resides in page 0 (location 0 to 199) for manipulating the A 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 (least recently used) replacement, and assuming page frame 1 has the process in it, and the two are initially empty: a. for (int j = 0; j