Question 3. Given a computer system with the following paging based addressing for virtual addresses. Please answer the following questions: 2 bits 5 bits 5 bits 5 bits 7 bits 1. What is the size of the virtual address space? 2. What is the page size? 3. What is the maximum number of pages for a process? 4. Given the system has a TLB hit ratio of 99% and page fault rate of 1%. Please formulate the effective memory access time. Question 4. (20 points) Consider a system with 1MB of available memory and requests for 42KB, 396KB, 10KB, and 28KB. The system is using Buddy Allocation Algorithm a). (10 points) Show the amount of memory allocated for each request and the state of memory after each request. Assume there is no memory release. b). (5 points) Why does internal fragmentation occur with buddy allocation? How much internal fragmentation exists in this scenario? c). (5 points) Why does external fragmentation occur with buddy allocation? How much external fragmentation exists in this scenario