Suppose a fixed partitioning memory system with partitions of 10k, 50k, 20k, 30k, and 60k, (in order) exist. All five partitions are currently available. Show the state of memory after processes of 22k, 40k, 11k, and 45k (in request order) arrive using the first fit, best fit, worst fit placement algorithm. (in a slot indicate the process and remaining memory)

First Fit