Q11. Given five memory partitions of 600, 300, 200, 500, 100 KB, (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 426, 112, 417 and 212 KB (in order)?Which algorithm makes the most efficient use of memory? Q12. Consider the following segment table: Length 600 Segment 0 1 2 3 Base 219 2300 90 1327 1952 14 100 580 96 a. What are the physical addresses for the following logical addresses? a. 0,430 b. 1,10 c. 2,500 d. 3,400 e. 4,112