input: Write a function to divide a given list of numbers into two equal parts such that the difference between the sum of the two parts is minimum. The function should return the two parts as lists. If the given list is empty, it should return two empty lists.
  assert divide_in_two_equal_parts([2, 3, 4, 5, 6, 7])==([2, 3, 7], [4, 5, 6])
  assert divide_in_two_equal_parts([10, 20, 30, 40])==([10, 40], [20, 30])
  assert divide_in_two_equal_parts([5, 8, 10, 15])==([5, 15], [8, 10])
  assert divide_in_two_equal_parts([1, 2])==([1], [2])
  assert divide_in_two_equal_parts([])==([], [])
output: def divide_in_two_equal_parts(nums):
      if not nums:
          return [], []
      
      total_sum = sum(nums)
      n = len(nums)
      dp = [[False] * (total_sum // 2 + 1) for _ in range(n + 1)]
      dp[0][0] = True
      
      for i in range(1, n + 1):
          for j in range(total_sum // 2 + 1):
              if j >= nums[i - 1]:
                  dp[i][j] = dp[i - 1][j] or dp[i - 1][j - nums[i - 1]]
              else:
                  dp[i][j] = dp[i - 1][j]
      
      for j in range(total_sum // 2, -1, -1):
          if dp[n][j]:
              part1 = []
              part2 = []
              current_sum = j
              for i in range(n, 0, -1):
                  if not dp[i - 1][current_sum] and dp[i - 1][current_sum - nums[i - 1]]:
                      part1.append(nums[i - 1])
                      current_sum -= nums[i - 1]
                  else:
                      part2.append(nums[i - 1])
              return part1, part2