Answer:
it can balance computing resources by time
Explanation:
this this is as it involves multiprogramming
The answer is the letter B.
Answer:
best-fit
Explanation:
Best-fit: Closest in size to the request: In the Dynamic Partitioning technique of memory management, the placement algorithm that scans memory from the location of the last placement and chooses the next available block that is large enough to satisfy the request
