Question 2 (20 points) 2. Three jobs are in the queue. The number of tickets each has and the number 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 Job #| Tickets |CPU time 10 40 50 10 10 20 3 Fig.2 What is the tumaround time of job 1 when using lottery scheduling algorithm ? (no need to include unit) A What is the turnaround time of job 2 when using lottery scheduling algorithm ? (no need to include unit) A/ What is the turnaround time of job 3 when using lottery scheduling algorithm ? (no need to include unit) A What is the average turmaround time when using lottery scheduling algorithm ? (no need to include unit)