Need help to solve this using divide and conquer approche please. Add comments on the code please. Also analyze the complexity of it. Thanks

Given an array of size n, find the majority element. The majority element is the element that appears more than You may assume that the array is non-empty and the majority element always exist in the array. Example 1: n/2 J times. Input: [3,2,3] Output: 3 Example 2 Input: [2,2,1,1,1,2,2] output: 2 Seen this question in a real interview before? Yes No 1 int majorityElement(int* nums, int numsSize)