The answer seems to be $none\space of\space these$ to me, but trying to reach one of the other options by taking some assumptions.
Given that $128$ x $128$ words are stored in $row\space major$ order, ie; elements are stored row by row. so there are total $128$ pages, each page containing elements $A[i]$ to $A[i]$. [Word addressible memory is taken because the size of a word and integer are not given in bytes.]
Now in the loop of the program, the words are accessed in $column\space major$ order $\rightarrow A$, $A$, $A$.. (inner loop is $i$).
Therefore a new page has to be accessed each time $A[i][j]$ is accessed.[Another assumption here, number of pages in memory at a time $<= 128$]
Hence the total number of page faults $= 128 * 128 = 16384$
So, the answer is $(B)$