With Round-Robin CPU scheduling in a time shared system

A

using very large time slices (quantas) degeneratesinto First-Come First served (FCFS) algorithm.

B

using extremely small time slices improves performance .

C

using very small time slices degenerates into Last-In First-Out (LIFO) algorithm

D

using medium sizedtime slices leads to shortest Requesttime First (SRTF) algorithm