Question 2 (20 points) Saved 2. Three jobs are in the queue The number of tickets each has and the nmumber of seconds of processing time each requires are shown in Table 2. Assume that quanta of CPU time are sufficiently small. and that no other processes get any tickets before the last of these processes complete. Answer the following questions. Table 2 ob #| Tickets |CPU time 10 10 40o 10 3 50 20 Flg.2 What is the turnaround time of job I when using lothery scheduling algorithm 7 (no need to include unit) 46.25 lgorithm 7 (no need to include unit 25 job 3 when using lottery scheduling algorithm ? (no need to include unin) 41.5 What is the turnaround time of job 2 when using lottery scheduling What is the turnaround time of What is the average turnaround time when using lonery scheduling algorithen (sus need to include smie 37.6 Question 2 (20 points) Saved 2. Three jobs are in the queue The number of tickets each has and the nmumber of seconds of processing time each requires are shown in Table 2. Assume that quanta of CPU time are sufficiently small. and that no other processes get any tickets before the last of these processes complete. Answer the following questions. Table 2 ob #| Tickets |CPU time 10 10 40o 10 3 50 20 Flg.2 What is the turnaround time of job I when using lothery scheduling algorithm 7 (no need to include unit) 46.25 lgorithm 7 (no need to include unit 25 job 3 when using lottery scheduling algorithm ? (no need to include unin) 41.5 What is the turnaround time of job 2 when using lottery scheduling What is the turnaround time of What is the average turnaround time when using lonery scheduling algorithen (sus need to include smie 37.6