Question #5: (2.5 pts) 1) Write a method boolean majority (int[] arr, int x), with the minimum complexity possible, that takes an array arr of integers, sorted in an ascending order, and an integer number x, and returns true if the majority of the elements in the array are less than x; otherwise it returns false. (Hint: Majority of the elements in the array means more than 50 % of the elements in the array.) 2) Compute the worst case complexity