Please don't copy the other solutions

(3) Given an array A of integers, we say that an integer k is the majority element of A if k occurs in A strictly more than A.length /2 times. Give a Divide and Conquer algorithm which, given an array A, determines if A contains a majority element. If A does contain a majority element k, it outputs k, otherwise, it outputs "null". Formally analyze the runtime of your algorithm, giving a recurrence relation and a big oh bound on the runtime of your algorithm. You must use a divide and conquer strategy. You do not have to prove correctness