An array with n objects, has a majority element if more than half of its entries are the same. Given an array, design an algorithm to tell whether there is a majority element, and if so, find that element. Your algorithm should run in O(n log n)

the answer is b) 2nd

hope this and plz mark as brainliest!

what is your question exactly? when you let me know i will gladly you. : )

you can not change you age soon as you signed up. the only way is too delete your account and use another account to sign up and put your correct age.