Given memory partitions of 100K, 350K, OOK, 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) i) Best Fit ii) Worst Fit ill) First Fit Used space 100K P1 350K 90K P3 200K 450K 22 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 0 6 1 3 2 0 3 4 4 5 vi V 1 1 V V 5 6 2 1 1 V Figure 2 b) Determine the physical address for the following logical address: 0) 1) 1700 2100 c) Determine the logical address for the following physical address: 0) 1) 2600 400 Q3 100 2400 Sort 3200 ma program 10001400 400 6300 2 400 4300 1100 1200 1000 4700 segment 4700 5700 6300 ment a) Based on the above diagram, determine the following physical address for the following logical address: 1) Segment 2 offset 100 ii) Segment 4, offset 600 ill) Segment 1, offset 450 Q4 1) ii) Explain about demand paging. Explain about page fault Explain about thrashing. Give 2 advantageous of virtual memory implementation iv)