input: 
  def divide_list_into_minimum_sum_difference(lst):
      """
      Divide a given list of numbers into two equal parts such that the difference 
      between the sum of the two parts is minimum.
      >>> divide_list_into_minimum_sum_difference([2, 3, 4, 5, 6, 7])
      ([2, 3, 4, 7], [5, 6])
      """
      lst.sort()
      part1 = []
      part2 = []
      left_sum = 0
      right_sum = 0
      
      for num in reversed(lst):
          if left_sum <= right_sum:
              left_sum += num
              part1.append(num)
          else:
              right_sum += num
              part2.append(num)
      
      return part1, part2
  
output:     part1.reverse()
      part2.reverse()
      return part1, part2