OPERATING SYSTEM [SHOW ME THE process with explanation ]

Memory Allocation Problem:

Consider the following memory unit: 0 Partition 1 256k Partition 2 288k Partition 3 416k Partition 4 480k Partition 5 512k Now, consider the following processes along with their size: P1 - 128k P2 240k P3 30k P4 - 60k P5 10k Now imagine, you try to fit the processes in the memory unit in serial from P1 to P5. Meaning, you try to fit P1 first, then P2, P3, P4, and P5. You can place only one process in a single partition and once a process takes place in a particular partition, no other process can take that place. You can use first fit, best fit and worst fit approach. The first fit has been solved for you. P1: Partition 1 P2: Waiting P3: Partition 2 P4: Partition 3 P5: Partition 4 Now, apply best fit algorithm and solve the following (If you find multiple best fits, pick the partition that comes first. For example if Partition 3 and 5 are multiple best fits, you have to pick partition 3): P1: Select an option v P2: Select an option P3: Select an option P4: Select an option v P5: Select an option Also, apply worst fit algorithm and solve the following (If you find multiple worst fits, pick the partition that comes first. For example if Partition 3 and 5 are multiple worst fits, you have to pick partition 3: P1: Select an option P2: Select an option P3: Select an option P3: Select an option P4: Select an option v P5: Select an option