A. Consider the two-dimensional array A in a paged system with pages of size 27. A small process is in e. how many page faults are generated by the following array-initialization Int A1 . new int[9)[9] er A0o is a location 63, page 1 for manipulat ting the matrix, every instruction fetch will be from page 1 For three page frames loop? All frames were initially empty. A LRU algorithm is used: for (int j 0, j9,j) For (int i 0 i9++ A[in] = 0; In the solution of this problem you should: show the contents of the logical address space, how the array and instructions are stored, give the reference string generated by the CPU during the initialization, On the reference string, show the page faults; for each reference, explain what element is initialized or if the instruction is fetched: Explain the final computation of the page fault number