code: def steady_state_replacement(random, population, parents, offspring, args):
      
      population.sort()
      num_to_replace = min(len(offspring), len(population))
      population[:num_to_replace] = offspring[:num_to_replace]
      return population
docs: Performs steady-state replacement for the offspring.
      
      This function performs steady-state replacement, which means that
      the offspring replace the least fit individuals in the existing
      population, even if those offspring are less fit than the individuals
      that they replace.
      
      .. Arguments:
         random -- the random number generator object
         population -- the population of individuals
         parents -- the list of parent individuals
         offspring -- the list of offspring individuals
         args -- a dictionary of keyword arguments