The queue associated with a semaphore implementation is for processes/threads waiting for the CPU (B) the dispatcher to decide when an l/O burst is done (C) processes/threads that are doing busy waiting None of the rest Which of the following is incorrect? Shortest-job-first scheduling can be preemptive. B FCFS is non-preemptive. The quantum of the round robin algorithm is the smaller the better. FCFS has a convoy effect