Someone tells you the consensus protocol discussed in lecture for synchronous systems is wrong because we do not know f (i.e., the number of failures in a group of processes). Your response is: (1 point) You can always set f=N, and the discussed algorithm would then be correct for synchronous systems. You can always set f=1, and the discussed algorithm would then be correct for synchronous systems. This is a hard problem, and an unsolved one. Yes, the algorithm discussed in lecture is incorrect if we don't know f. In Paxos, which of the following decisions does not require a quorum (majority)? (1 point) Collecting OKs during the Election (first) phase in a round Before deciding the ballot id in the Election phase Acknowledgments after sending the decision in the Law (third) phase in a round Deciding a value at the end of Bill (second) phase in a round