Consider the 2-dimensional array A: int a[][] = new int[9][9]; Where A[0][0] is at location 89, in a paged system with pages of size 27. As small process is in page 1 for manipulating the matrix; every instruction fetch will be from page 1. For 3 page frames, how many page faults are generated by the following array-initialization loop? All frames were initially empty. An LRU algorithm is used: for(int j=0; j