In the binary voting model wChoose the correct statement that involves the Condorcet winner or the Condorcet loser: Group of answer choices For all voting profiles, there is a Condorcet winner There can be more than one strong Condorcet winner There exist voting profiles with two weak Condorcet winners If there is a cycle, there cannot exist a Condorcet winner If there is a top cycle, there cannot be a Condorcet loserith two alternatives, constant 0 is a method that returns a tie no matter the vote distribution. Constant 0 does not satisfy: Group of answer choices Anonymity Unrestricted Domain Neutrality Positive Responsiveness