Q1) [1 point] How can multilevel queues be scheduled? Which might have priority over Q2) 13 points. 1.5 point eachl 1. Assume you want to implement a web-server for YouTube by using multithreading, where others? each thread serves one incoming request by loading a video file from the disk. Assume the OS only provides the normal blocking read system call for disk reads, do you think user- level threads or kemel-level threads should be used? Why? 2. Now you want to implement a web-server for Facebook, to serve each user's "Home" page (the first page you see after you log in). This time your web-server needs to perform many tasks: load the news feeds from each of your friends, load the advertisement, check for new messages, etc. Now you want to implement your webserver by using multithreading, and have one thread to perform each of the tasks, and later these threads will cooperate with each other to collectively construct the Home" page. For performance reasons, Facebook makes sure that all the data these threads need is already cached in the memory (so they don't have to perform any disk LO). Do you think user-level threads or kemel-level threads should be used? Why? Q3)[16 points, 4 points eachl Consider the following set of processes, with the length of the CPU burst time given in milliseconds Nu val P2 P3 P4 P5 10 Assume that if a new process arrives at the same time that a process finishes using the CPU, then the new process will be added to the ready queue first. 1. I4 points] Draw four Gant chart illustrating the execution of these processes using the following scheduling algorithms: a) SJF b) SRTF c) a non-preemptive priority (a smaller priority number implies a higher priority d) RR (quantum 2) scheduling. 2. 14 pointsl What is the waiting time of each process for each of the scheduling algorithms 3. 4 points What is the average waiting time for each of the scheduling algorithms in part 4. 14 points] What is the turnaround time of each process for each of the scheduling in part 1? 1? algorithms in