$-$ Consider the two$-$dimensiona arring A

int A$[][]=$ new int $[100][100]$

pages

where A $[0][0]$ is at location $200$ in a paged memory system with of size $200.$ A small process that manipulates the matrix resides in page o $($locations $0$ to $199).$ Thus every instruction fetch will be from page $0.$ For three page Fromes, how many page Faults are generated by the following array$-$initialization loops, using LRV replacement and affumming that page Frame $1$ contains the process and the other two are initially emply $71$

a$)$

for $($int j$=0$; j$<100$; j$++).$ For $($int i$=0$; i$<100$; i$++)$ AT$-$O

b$)$

J

for $($int $=0<100$; $1++)$ For $($int; $=0$; j $<100$; j$++)$ A$[][]=0$