In the Bakery Algorithm to Solve the Critical Section Problem___________

Multiple Choice

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