Study the Bakery Algorithm and prove the following property: If Pi is in a critical section and Pk (k i) has already chosen its number[k] 0, then...

Study the Bakery Algorithm and prove the following property: If Pi is in a critical section and Pk (k i) has already chosen its number[k]  0, then (number[i], i) < (number[k], k). Once that is proven, complete the proof that only one process can be in the critical section.