Explain the leader follower election in a distributed system.

Focus on clearly defining what a leader-follower election is and its purpose in a distributed system. Discuss the scenarios where leader election is necessary, such as ensuring data consistency and coordinating tasks among nodes. Explain common algorithms used for leader election, like the Bully Algorithm or Paxos, and highlight their strengths and weaknesses. Be prepared to illustrate how these algorithms handle failures and ensure fault tolerance. Use examples to clarify your points and demonstrate your understanding of the trade-offs involved in different approaches.