Greetings, i figure how the first 2 questions but questions 3 and 4 have me guessing especially number 4. Thank you.

Modify the 'myexp.exp' file to have 5 run lines that will use the following algorithms: FCFS, SJF, RR 1, RR 5, and RR 10. On each run line, make sure that both the algorithm and key are correctly identify each other.

Now modify the 'myrun.run' file so that there will be a total of 20 processes with the following properties:

All processes arrive at time 0.0

All processes have a constant duration of 100

All have constant I/O bursts of 10

All have basepriority 1.0

The first set of 10 processes have CPU bursts uniformly distributed between 2 and 8

The last set of 10 processes have CPU bursts uniformly distributed between 30 and 40

Do not change the seed line of the run file as this will change the sample space.

Example of 'myexp.exp':

name myexp comment This experiment contains 5 runs

run myrun algorithm FCFS key "FCFS"

run myrun algorithm SJF key "SJF"

run myrun algorithm RR 1 key "RR 1"

run myrun algorithm RR 5 key "RR 5"

run myrun algorithm RR 10 key "RR 10"

Example of 'myrun.run': name myrun

comment This contains two types of processes

algorithm SJF seed 5000 numprocs 10 firstarrival 0.0 interarrival constant 0.0 duration constant 100.0 cpuburst uniform 2.0 8.0 ioburst constant 10.0 basepriority 1.0 numprocs 10 firstarrival 0.0 interarrival constant 0.0 duration constant 100.0 cpuburst uniform 30.0 40.0 ioburst constant 10.0 basepriority 1.0

3.Now let us analyze the results. SJF will have the best average waiting time. This is easily identifiable by graphing the Waiting. Why is this behavior evident with our chosen example?

4.Next, compare the trend in the Round Robin experiments as the quantum increases. For large values of the quantum which algorithm will Round Robin mimic and how large does the quantum need to be for our example?