Consider the original time-shared computer model of Sec. 2.5 and the alternative processin...

Consider the original time-shared computer model of Sec. 2.5 and the alternative processing policy described in Prob. 2.18, both with n = 35 terminals. Use the procedure of Sec. 10.4.1 with n₀ = 20 to recommend which processing policy results in the smallest steady-state mean response time of a job. To obtain the X_ij’s here, warm up the model for 50 response times, then use the average of the next 640 response times, and replicate as needed. Choose your own P* and d*, perhaps based on cost considerations, or your own feeling about what constitutes an “important” difference in mean response time.