Some scheduling algorithms give priority to processes that do not use their time quantum fully because:

A$.$ These processes may suffer from starvation

B$.$ These processes are CPU bound processes

C$.$ These processes may be interactive

D$.$ These processes terminate quickly and are removed from the process table