Question 3 [ 2 points ] indicate only: True or False A round robin scheduling algorithm can be non preemptive. Question 4 [ 2 points ] indicate only: True or False The most commonly used scheduling algorithm for interactive systems is fcfs scheduling.Question 5 [7 points ] Can any of the two scheduling schemes (SJF preemptive, or RR) result in starvation? If so, how might you fixed this? Explain.