The SJF algorithm executes first the job

• A. that last entered the queue
• B. that first entered the queue
• C. that has been in the queue the longest
• D. with the least processor needs