Each function ( Best-fit, First-fit, Next-fit, and Worst-fit) count the length of time required to process the task stream. Scheduling is to work as follows: 1. Until a task cannot be placed, place the next task in the stream 2. Increment the time consumed by one. 3. Decrement time remaining for all tasks in memory by one. 4. If tasks remain in the stream, go back to 1. 5. Increment the time consumed by the largest time remaining for tasks in memory. 6. Return the amount of time consumed by the stream.