The FIFO algorithm-

• ক executes first the job that last entered the queue
• খ executes first the job that first entered the queue ✅ সঠিক উত্তর
• গ executes first the job with the least processor needs.
• ঘ execute first the job that has been in the queue the longest