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. For the following questions, please circle the correct answer from the candidate list Using lottery scheduling algorithm, Table 2 turnaround time for Job 1 is turnaround time for Job 2 is: turnaround time for Job 3 is: average tunaround time is: Jobs | Tickets | CPU time 30 10 30 15 40 10