The FIFO algorithm

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