this question from algorithm course.

In the elections, the winner has a majority when he wins more than half of entries votes, which means more than half of array A[1...n] are the same, the task is: 1. Design a BF efficient algorithm to tell whether the array has a majority element, and, if so, to find that element. Then derive time complexity. 2. Design a D & C algorithm to tell whether the array has a majority element, and, if so, to find that element. Then derive the time complexity