In case of failure, a new transaction coordinator can be elected by ____________
(a) bully algorithm
(b) ring algorithm
(c) both bully and ring algorithm
(d) none of the mentioned
I have been asked this question in examination.
My enquiry is from Distributed Synchronization topic in chapter Distributed File Systems of Operating System