1. Another placement algorithm for dynamic partitioning is referred to as worst-fit. In this case, the largest free block of memory is used for bringing in a process.

a. Discuss the pros and cons of this method compared to first-fit, next-fit, and best-fit.

b. What is the average length of the search for worst-fit?

2. Contrast the scheduling policies you might use when trying to optimise a time-sharing system with those you would use to optimise a multi-programmed batch system.

please explain fully all