題組內容

4.(5points) Continuing from the last question, for the correct version of Lamport's Bakery algorithm, please answer which of the following statements is/are correct ?

(c) The entry section complexity is O(3n+2) queries to peer processes.