Consider now an election with 3 candidates. say there is a winner only if a candidate recieves more than 50 percent of the vote, otherwise there is no winner. if we’re given another integer’s worth of storage, come up with an algorithm to determine the winner if there is one. for simplicity, your algorithm can output any of the candidates in the case that there is no winner (not necessarily the one with the most votes). votes are now numbered 0, 1, 2.