The SJF algorithm executes first the job

• that last entered the queue
• that first entered the queue
• that has been in the queue the longest
• with the least processor needs
• None of the above