Consider the following scenario. votes are being cast for a major election, but due to a lackof resources, only one computer is available to count the votes. furthermore, this computeronly has enough space to store one vote at a time, plus a single extra integer. each vote is asingle integer 0 or 1, denoting a vote for candidate a and candidate b respectively.(a) come up with an algorithm to determine whether candidate a or b won, or if there wasa tie

Explanation:

Assuming that a simple majority is sufficient for a win, we can keep track of the difference in the number of votes for the two candidates.

__

1. set the integer to zero

2. while there are votes to count ...

3. increment the integer if the vote is 1, or decrement the integer if the vote is 0

4. end while

5. if the final value of the integer is positive, Candidate B won. If it is zero, there was a tie. If it is negative, Candidate A won.

1

explanation:

d would be the most obvious choice to this question. leaders are supposed to herd their underlings like a shepherd to sheep. a leader should also listen to others when they are talking to one other to gain a better understanding of their mission and surroundings.

explanation: