2.a) Write a pseudo-code for "binary search" problem. In this problem, you will search an element in a sorted array. For example: A [1, 4, 7, 9, 12, 24, 56, 61, 62, 65, 89] If the search element is 12, your algorithm must find its index. 2.b) Perform a complexity analysis for your algorithm What is the best, average, and worst case?