Round-robin scheduling A. allows interactive tasks quicker access to the processor B. is quite complex to implement C. gives each task the same chance at the processor D. allows processor-bound tasks more time in the processor E. None of the above

Round-robin scheduling is a fair scheduling algorithm, because each process gets the same chance to run. It is also a simple algorithm to implement. However, it can be inefficient, because processes that are waiting for input or output may not be able to run for a long time.

Option A is incorrect, because round-robin scheduling does not give interactive tasks quicker access to the processor. All tasks get the same chance to run, regardless of whether they are interactive or not.

Option B is incorrect, because round-robin scheduling is a simple algorithm to implement. It does not require any complex calculations or data structures.

Option D is incorrect, because round-robin scheduling does not allow processor-bound tasks more time in the processor. All tasks get the same chance to run, regardless of whether they are processor-bound or not.

Option E is incorrect, because round-robin scheduling is a valid CPU scheduling algorithm. It is not a myth or a hoax.