QUESTION 2 [15 Marks] (a) Consider a memory contains page of 100 bytes each and the addresses space as shown in Figure 1. 0000 Page 0 0100 0321 0555 0111 0100 Page 1 0400 0350 0100 0280 0200 Page 2 0300 0050 0050 0010 0080 Page 3 0400 0603 0509 0455 0300 Page 4 0500 0030 0100 0200 0330 Page 5 0600 Page 6 0010 0520 0100 0001 0700 Figure 1 Figure 2 i) If CPU accesses the addresses shown in Figure 2, write the complete reference string. (Note: The arrow indicates the starting address from the first row). [2 Marks] 11) If the system using any policy of the page replacement with 7 frames for the reference string above, what will be the consequence to the page faults? Briefly justify your answer. [3 Marks] (b) Table 3 illustrates the frames used with the current page reference using LRU page replacement algorithms at time t10. Answer the following questions. Table 3 Frame 0 1 2 3 Page Reference 2 1 3 4 i) Consider the following new page reference string: 21 56 21 23 763 21235 By constructing a table with the page reference in the frames, identify how many page faults would occur using the same page replacement algorithms? Show your working. [7 Marks] ii) Based on the previous answer, how to reduce the page fault number? Briefly, justify your answer. [3 Marks]