please answer the questions correct based on the table (base and limit)

Question-1 Suppose that memory is 2000 Bytes. The following table represent the Base and limit for each process in RAM. Solve the following questions: Base P1 0 P1 P2 450 limit 150 500 200 50 P3 1200 P4 1800 If Os wants to allocate space for new process (Process-5). The size of P-5 is 200 Byte. a. Using First Fit method, what will be the value of base and limit register. P2 b. Using Best Fit method, what will be the value of base and limit register. P3 c. Using Worst Fit method, what will be the value of base and limit register. P4 Question -2 Suppose that memory is 2000 Bytes. The following table represent the Base and limit for each process in RAM. Solve the following questions: Base limit 150 P1 0 P1 P2 450 500 P3 1200 200 P4 1800 50 Suppose P-4 terminated. And the RAM space had been updated after this termination. 1. Update the physical memory and the table of base and limit values P2 2. If Os wants to allocate space for new process (Process-5). The size pf P-5 is 200 Byte a. Using First Fit method, what will be the value of base and limit register. P3 b. Using Best Fit method, what will be the value of base and limit register. P4 c. Using Worst Fit method, what will be the value of base and limit register. Question - 3 Assume that a processi with 4 segments is assigned a segment table as shown in the following table. Segment Base 0 3000 1 Limit 500 340 1000 1020 2050 2 1500 3 350 1. Draw the physical memory and locate the segments of Processi Translate the logical address to a physical address: A) Logical address (0,400): B) Logical address (2,1400): C) Logical address (0,400): Question-4 Assume a paging system for a physical memory of 128 bytes and a page size of 8 bytes. The page table for a process-1 is as follow Page Frame 0 10 1 5 2 2 13 3 7 1. How many frames in physical memory? 2- Draw the physical memory and allocate the pages using the given page table. 3. Translate the logical address to a physical address: A) Logical address (3,5): B) Logical address 30: C) Logical address 64