Q11) Given five memory partitions in order of 100KB,500KB,200KB, 300k,600kB and four processes in fable a) Hlustrate the new memery portitons after all processes are loaded using the following algorithmas i) Firet Fit ii) Best Lil i iii) worst fit 1 b) Based on Yout answer in QuI (a), disesss the nof most efficiens Algorithm for each of the following criteria: - i) speed ii) memor utlization