Prove that the algorithm(version 5) meets all of the requirements for concurrency control: a. Only one transaction at a time is allowed into its critical section among all transactions that have critical sections for the same shared data.
b. It must not be possible for a transaction requiring access to a critical section to be delayed indefinitely.
c. When no transaction is in a critical section, any transaction that requests entry to its critical section must be permitted to enter without delay.
d. No assumption are made about relative speeds or number of transactions.