With round-robin CPU scheduling in a time shared system

• A. using very large time slices degenerates into First-Come First Served Algorithm
• B. using extremely small time slices improves performance
• C. using very small time slices degenerate into Last-In-First-Out algorithm
• D. using medium sized time slices leades to Shortest Request Time First algorithm.