ar ano o ppoatat ca Packages Microsoft MicrosoftEdge 8 ekyb3de b e Te mpState Do loads As menti %20 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 as I did in the video tutorial. What is the best, average, and worst case? No code submission over Canvas is necessary. Please submit your solutions to the Canvas on due date as Word or Pdf file. On the top of your paper, please add your name and number, Course ID, Assignment number and the date. ort se ebackspace 4 5 6 7 8 9 0