code: def take_closest(myList, myNumber):
      
      pos = _bisect_left(myList, myNumber)
      if pos == 0:
          return myList[0]
      if pos == len(myList):
          return myList[-1]
      before = myList[pos - 1]
      after = myList[pos]
      if after - myNumber < myNumber - before:
          return after
      else:
          return before
docs: Assumes myList is sorted. Returns closest value to myNumber.
      If two numbers are equally close, return the smallest number.
  
      Parameters
      ----------
      myList : array
          The list in which to find the closest value to myNumber
      myNumber : float
          The number to find the closest to in MyList
  
      Returns
      -------
      closestValue : float
          The number closest to myNumber in myList