code: def is_inside_bounds(point, bounds):
      
      if isinstance(point, (int, float)):
          point = [point]
      if isinstance(point, collections.Iterable) and not isinstance(point, collections.deque):
          if len(bounds) < 2 * len(point) or len(bounds) % 2 != 0:
              raise AssertionError('Bounds mismatch point dimensionality')
          point = collections.deque(point)
          bounds = collections.deque(bounds)
          return is_inside_bounds(point, bounds)
      if not isinstance(point, collections.deque):
          raise TypeError('Unknown input data type ({}).'.format(type(point)))
      if len(point) < 1:
          return True
      p = point.popleft()
      lower, upper = bounds.popleft(), bounds.popleft()
      if lower <= p <= upper:
          return is_inside_bounds(point, bounds)
      return False
docs: Checks if a point is inside a set of bounds. This is implemented
      through recursion so that this is N-dimensional.