Consider three CPU-intensive processes, which require 10,20 and 30 time units and arrive at times 0,2, and 6, respectively. How many context switches are neededif the operating system implements a shortest remaining timefirst scheduling algorithm? Do not count the context switchesat time zero and at the end

A

1

B

2

C

3

D

4