input: Write a Python function to find the maximum element in a list using a divide and conquer algorithm.
  assert max_element([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == 10
  assert max_element([10, 20, 45, 67, 84, 93]) == 93
  assert max_element([5, 7, 9, 8, 6, 4, 3]) == 9
output: def max_element(lst):
      if len(lst) == 1:
          return lst[0]
      mid = len(lst) // 2
      left_max = max_element(lst[:mid])
      right_max = max_element(lst[mid:])
      return max(left_max, right_max)