Question 4 (5 marks) (modified exercise 2.23-a of DPU textbook) An array A[1...n) has a majority element if more than half of its entries are the same. Given an array, the problem is to design an algorithm to find such an element if one exists. Note that the elements of A are not necessarily orderable, but a pair can be tested for equality in constant time. Design and write a divide-and-conquer algorithm that solves this problem in O(n log(n)) time