Q1 Given memory partitions of 100K, 350K, 90K, 200K, and 450K shown in figure 1, Illustrate how would each process P5 ( 105K), P6 (85K), P7 (300K), and P8 (155K) arrive orderly will be placed in the memory if the following method is used: (Draw different diagram for each method) ) Best Fit 1) Worst Fit iii) First Fit Used space 100K PI 350K P2 90K P3 200 K 450K Q2 Draw a diagram to show how physical memory (frames) will be filled up based on the following page table in Figure 2. (assume page size = 500 bytes) Page Frame vi 0 6 1 1 V 1 2 3 4 3 0 4 5 V v 5 6 2 1 i V Figure 2 b) Determine the physical address for the following logical address: 1700 2100 c) Determine the logical address for the following physical address: 1) 2600 400 Q3 100 wy Son 200 1000 1400 400 6300 2 400 400 1100 1200 1000 program gen 4300 4700 700 6700 a) Based on the above diagram, determine the following physical address for the following logical address: Segment 2 offset 100 ii) Segment 4. offset 600 II) Segment 1, offset 450