Suppose you are responsible for organizing and determining the results of an election. An election has a winner if one person gets at least half of the votes. For an election with n voters and k candidates, design an divide-and-conquer algorithm to decide if the election has a winner and finds that winner. Analyze the time complexity of your algorithm.