suppose university high school (uhs) is electing its studentbody president. suppose further that everyone at uhs is a candidate and voters write down the student number of the person they are voting for, rather than checking a box. let a be an array containing n such votes, that is, student numbers for candidates receiving votes, listed in no particular order. your job is to determine if one of the candidates got a majority of the votes, that is, more than n/2 votes. describe an o(n)-time algorithm for determining if there is a student number that appears more than n/2 times in a.