Consider the following data list: A = [10, 13, 18, 20, 23, 26, 28, 30, 48, 67, 89, 98, 101, 107] i) Use binary search to find the element 101. Show step-by-step calculations of the mid index and mention the number of iterations required. ii) Write the pseudocode for binary search.

Consider the array, A = [12, 45, 23, 67, 34]. Perform the following: a) Find the position of 67 using linear search. Show each comparison. [2 Marks] b) Before performing binary search, sort the array in ascending order. Then find the position of 45 using binary search. Show all steps. [3 Marks]

How to compute algorithm complexity? Analysis the complexity of Binary Search Algorithm for the following input and search item 13. [5, 8, 11, 13, 29, 35, 36, 38]