Can someone help me with this question pls??
Given an array of N elements, you notice that there are some duplicate values. Implement a modified merge function such that the mergesort code we saw in class both sorts the array and removes all duplicates from the array. Your algorithm should run in O(N log N) time; briefly argue/justify that your program runs in O(N log N) time. Note: You are not allowed to simply call mergesort, and then
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured