For the pseudocode below, write and solve the summation, stating the best and worse case.

Binary Search - an Iterative Algorithm ALGORITHM BinarySearch(A[0.n-1], K) //Implements nonrecursive binary search //Input: An array A[O..n-1] sorted in ascending order and // search key K //Output: An index of the array's element that is equal to K // or -1 if there is no such element while l s r do //Il and r crosses over>can't find K. m(1 + r) / 2 if K = A[m] return m else //the key is found if K A[m] rk m - 1//the key is on the left half of the array else I m + 1 // the key is on the right half of the array return -1 16