Plz explain clearly, will upvote if correct!

Q:

You are given a sorted array of n elements, and you are required to find a

frequent element: a frequent element in an array of size n is an element that

appears more than n$/2$ times in the array.

Examples: If the array is $\{1,2,3,3,3,3,10\},$ M $=3$ then the answer is

True. If the array is $\{1,1,2,4,4,4,6,6\},$ M $=4$ then the answer is False. If the

array is $\{1,1,1,2,2\},$ M $=1$ then the answer is True.

A$)$ Describe an algorithm that takes a sorted array of size n and a number

M to be searched as parameters, and returns true if and only if M is a

majority element $($present more than n$/2$ times$).$ For this, the runtime of

your algorithm can be O$($n$)$

B$)$ Here, we explore what would happen if the input array was unsorted.

What would you do in this case? What is the runtime of your algorithm?

Full credit will be given only if the proposed algorithm is proven to be

optimal