Assume each page is 512 bytes in size and the size of an integer is 2 bytes. Consider two C programs (Program 1 & Program 2) designed to initialize all elements of a 256-by-256 two-dimensional array (called arr as below) to 0. The array is stored in row-major order; that is, the array is stored arr[0][0], arr[0][1], …, arr[0][255], arr[1][0], …. If the operating system only allocates 128 page frames on-demand to each program and adopts Least-Recently-Used (LRU) page replacement policy to manage those fames, please answer the following two questions.