Consider the following Binary Search algorithm implemented in python. Choose the option that can replace the blanks (i) and (ii) respectively.

def binarySearch(list, key):

      first = 0

      last = len(list) - 1

      while(first <= last):

          mid = (first + last)//2

          if list[mid] == key:

               return mid

          elif key > list[mid]:

               ___________ (i)

          else:

               ___________ (ii)

      return -1