Given a list numList of n elements and key value K, arrange the following steps for finding the position of the key K in the numList using the binary search algorithm i.e. BinarySearch(numList, key).
mid = (first + last) // 2first = 0, last = n - 1first <= last REPEATnumList[mid] = key, numList[mid] > key, THEN last = mid - 1first = mid + 1