Il. Problems 1. Figure 2.6 in the textbook (and Slide 26 of the presentation on Chapter 2) compare multiprogramming and uniprogramming of three processes. Consider the following four processes. Assuming multipr ing and 100M of available memory, what is the shortest ssible time to completion? Explain (or present a figure of your solution) JOB1 5 min Duration %CPU usage | 5096 Memo JOB2 10 min 25% 25M JOB3 15 min 25% 50M JOB4 20 min 50% 25M 75M 2. Repeat Exercise 1. For the following five processes Duration %CPU usage Memo JOB1 5 min | 7596 50M JOB2 10 min 25% 25M JOB3 15 min 25% 50M JOB4 20 min 50% 25M JOBS 25 min 50% 25M 3. Three operating systems were tested for fault tolerance. After the first fault in the new year the length of each subsequent down time and up time was measured until the fifth down time. The following (albeit small sample) data was collected Down Up Down Up Down Up Down Up Down Up TimeTim Time minutes hours minuteshoursminutes hours minutes hours minuteshours Time Time Time Time Time Time Time 0S1 0S2 OS3 10 12 100 20 90 15 80 13 80 18 90 Calculate MTTF, MTTR, and Availability for each of the three operating systems. Which one would you select in a mission critical application with the down time growing exponentially more expensive with each con perception of continuous up time was the most important? Explain your answers secutive down minute? Which one would you select if