3. (30 points) A gatekeeper receives a daily unsorted list of the nids 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. a. Write the C-like pseudocode for the gatekeeper b. Analyze the complexity of your code i Is this approach optimal? Why or why not? C. How would you describe your approach