Answer:
preemptive scheduling follows round robin where each process is given for some amount of time to execute
Step-by-step explanation:
In this scheduling algorithm , the CPU allocates limited time for the process to execute. The execution of the process interrupted in middle if any high priority one comes in to the queue. Here context switching will save the current state of the process and resumes later. In general the process moves from ready to waiting and vice versa. It has overhead of scheduling the process and is cost associated with it