Assume that your computing infrastructure has 5 processors available. Processors are identified as PA, PB, P. Consider n = 200 processes with different runtime requirements. Specifically, each process has associated with it a burst time (processing time) and a memory requirement. Burst-times are assigned at random (10 * 106 cycles 50 *1012 cycles). Memory requirements are assigned at random (.25 MB 8GB). For questions 1 3, you may assume that the set of 200 processes is known a-priori; Hence, you will have to develop a function that can generate this set with random burst-times and memory requirements.

1. Suppose that all 5 processors are identical (i.e., same speed and memory), develop and impplementing a scheduling algorithm that assigns the set 200 processes to the 5 processors such that the total turnaround time to complete all 200 processes is minimized. Can you find the best assignment? How close does your scheduler approximate the best assignment?