$16]$ You have been commissioned to write a program for the next version of electronic voting software.

The input will be the number of candidates, $d,$ and an array votes of size $v$ holding the votes in the

order they were cast where each vote is an integer from $1$ to $d.($You can assume that $d$ is typically

much smaller than v$.)$ The goal is to determine if there is a candidate with a majority of the votes. If

there is a candidate with the majority of the votes, you are to output the indices in votes for the

elements that hold a vote for the winning candidate. Describe the algorithm that you would

recommend to solve this problem. Analyze the time complexity of your algorithm $($as a function of $d$

and $v)$ and very briefly argue why it was the best choice.