A particular program uses 100 data objects, each 105 bytes long. The objects are contiguously allocated in a two-level memory system using the LRU page replacement policy with a fast memory of 106 bytes and a page size of 103 bytes. The program always makes 1,000 accesses to randomly selected bytes in one object, then moves on to another randomly selected object (with probability 0.01 it could be the same object), makes 1,000 accesses to randomly selected bytes there, and so on.

a. Ignoring any memory accesses that might be needed for fetching instructions, if the program runs long enough to reach an equilibrium state, what will the hit ratio be?

b. Will the hit ratio go up or down if the page size is changed from 103 words to 104 words, with all other memory parameters unchanged?