1. Assume that the list of holes in a variable partitions memory system contains the following entries (in the given order): 50 KB, 400 KB, 130 KB, 300 KB, 150KE and 70KB. Consider the following sequence of requests (in the given order): A 230 KB, B-180 KB, C-130 KB, D-120KB, E-200 KB. Determine which holes would be allocated to which request by each of the following schemes and compute total internal fragmentation and external fragmentation for each algorithm. (3 points) a. First fit b. Best fit c. Worst fit 2. Consider a simple paging system with the following parameters: 2-0 bytes of physical memory: page size of 210 bytes; 210 pages of logical address space. Answer the following questions (3 points) a. b. c. d. e. f. How many bits are in a logical address? How many bits in a frame? How many bits in the physical address specify the frame? How many bits in the logical address specify the page? How many entries in the page table? How many bits in each page table entry? Assume each page table entry includes a valid/invalid bit. 3. Consider a paged memory system (with no virtual memory). Suppose memory access time is 40 nanoseconds and that it takes 15 nanoseconds to search the associative memory used to store part of the page table. If the miss rate for this associative memory is 0.1, what is the effective memory access time? (1 point)