EXERCISE 2.12. Consider the following leader election algorithm: For n EN n processes P1,..., Pn are located in a ring topology where each process is connected by an unidirectional channel to its neighbor in a clockwise manner. To distinguish the processes, each process is assigned a unique identifier id e{1,...,n}. The aim is to elect the process with the highest identifier as the leader within the ring. Therefore each process executes the following algorithm: send (id); initially set to process' id while (true) do receive (m); if (m = id) then stop; process is the leader if (m > id) then send (m); forward identifier od (a) Model the leader election protocol for n processes as a channel system. (b) Give an initial execution fragment of TS([P1|P2|P3]) suc that at least one process has executed the send statement within the body of the whileloop. Assume for ()