8. Consider a system that uses pure demand paging. (2 pts) a) When a process first starts execution, how would you characterize the page-fault rate? b) Once the working set for a process is loaded into memory, how would you characterize the page- fault rate? c) Assume that a process changes its locality and the size of the new working set is too large to be stored in available free memory. Identify some options designers could choose from to handle this situation. 9. Consider a demand paging system with three frames and the given page reference sequence "1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5". How many page faults does LRU page replacement algorithm generate? (1 pt) 10. Choose the best answer (1 pt). A memory management unit (MMU) is responsible for: (a) Translating a process' logical addresses to physical addresses. (b) Allocating kernel memory. (c) Allocating system memory to processes. (d) All of the above