Bully Algorithm in Distributed Systems

The C code implements the Bully Election Algorithm for a distributed system by initializing processes with unique IDs and active status. The user inputs the number of processes and IDs of failed processes. If the coordinator fails, an election starts from a user-specified process, which sends election messages to higher-ID processes. Active higher-ID processes reply; if none respond, the initiating process becomes the coordinator. The elected coordinator broadcasts its status to all processes, with detailed outputs for each step.