Problem 2. LCR Leader election ( 20 points). In this problem, you will create a model of a leader election algorithm in a unidirectional ring [2]. Here is the informal description of the protocol: Each process sends its identifier (ie, its index) to its successor around the ring. When a process receives an incoming identifier, it compares that identifier to its own. If the incoming identifier is greater than its own, it keeps passing the identifier; if it is less than its own, it discards the incoming identifier; if it is equal to its own the process declares itself as the leader. 1 (a) Write the model of the system with n processes in the ring using the language we saw in class. To get you started, the set of variables is: - send: The identifier to send or null, - status: Takes values in \{unknown, leader } to indicate that the leader has been elected or not. (b) Write an execution of the system in which status of at least one process is eventually set to leader. (c) Write two candidate invariants