Given the following process and memory information in an OS using Dynamic Partitioning placement algorithms, apply each of the following algorithms: Best Fit, First Fit, and Next Fit to each of the processes below and draw diagrams to illustrate your results.

With dynamic partitioning, the OS must decide what free memory space to place a process in$.$ Three algorithms that could be used are:

Assume that each process arrives in the order given.

Program Memory Location

OS $0-7999$

Free space $8000-11999$

Other programs $12000-15999$

Free space $16000-23999$

Other programs $24000-33999$

Free space $34000-43999$

Other programs $44000-45999$

Free space $46000-51999$

Other programs $52000-56999$

Free space $57000-76999$

Other programs $77000-79000$

Free space $80000-83999$

Other programs $84000-89999$

Process Length $($lines$)$

Process $14000$

Process $26000$

Process $38000$

Process $44000$

Process $52000$

Process $610000$

Compare the performance of each of the algorithms for the given scenario, paying particular attention to fragmentation and algorithm efficiency.

The Best Fit algorithm: Chooses the block that is closest in size to the request.

The First$-$fit algorithm: May load many processes in front end of memory that must be searched over when trying to find a free block.

The Next$-$fit algorithm: More often allocate a block of memory at the end of memory where the largest block is found. The largest block of memory is broken up into smaller blocks.