It is assumed in Rana 's algorithm that processes have identities. Now assume instead that processes are anonymous, but have a means of sending messages to their successors in the ring, and that the...

It is assumed in Rana 's algorithm that processes have identities. Now assume instead that processes are anonymous, but have a means of sending messages to their successors in the ring, and that the number of processes is known. Modify Algorithm 8.10 to work under this assumption.