Is it possible to create an O(n) algorithm (both time and space complexity) that will determine if there exists an element in the array, such that that element occurs [n/2 times in the array Which of the following statements is TRUE? Select one: a There always exist an element satisfying the condition specified above. b. The median element occurs (n/2 times. c. If an cloment occurs [n/2 times thon it is the median d. There are other cloments aside from the median that can occur (n/2) Oo. None of the above statements is true of the median can be computed in O(n) time, what is the time complexity of an algorithm that will determine if there exists an element such that the element occurs (n/2 times in the array ? Select one: a O(n) b. On log) c. O(log) od O(n) .: 0(1)