please use a divide and conquer algorithm to solve this question

IDs are integers, and the list is initially unsorted

3. (30 points) A gatekeeper receives a daily unsorted list of the n ids of visitors and must determine if any visitor registered more than n/2 times. If so, that id is passed onto headquarters. If not, the minimum and maximum ids are passed to headquarters. Write the C-like pseudocode for the gatekeeper b. Analyze the complexity of your code i. Is this approach optimal? Why or why not? How would you describe your approach? a. c