In the bakery algorithm to solve the critical section problem ____________

A. Each process is put into a queue and picked up in an ordered manner

B. Each process receives a number (may or may not be unique) and the one with the lowest number is served next

C. Each process gets a unique number and the one with the highest number is served next
D. Each process gets a unique number and the one with the lowest number is served next

Occurrence: 0, System Administrator 2026