Problem 1 (15 Points) Cousider a eory design where the virtual address space is partilioued into four virtual pages (i.e. each page table has four entries). Assue that the physical memory can hold at most two physical pages at any time (in physical page numbers 0 and 1; physical page numbers greater than 1 refer to disk). The design uses a fully associative placement scheme with LRU replacement and write back policy for the pages. The "reference" field in the page table below gives the most recent time a particnlar page was used. Suppose at time t-5, the page table has the following information Virtual page Reference time Dirty bit Valid bit number Physical page number 0 0 (a) Suppose the processor wants to read from virtual page # 2 at time t-6. Will there be a page fault? If not, why? If yes, which existing virtual page will be replaced and why