input: Write a function to find the maximum element using divide and conquer approach.
  assert find_max_Using_Divide_and_Conquer([1, 2, 3, 4, 5]) == 5
  assert find_max_Using_Divide_and_Conquer([10, 20, 5, 8, 7]) == 20
  assert find_max_Using_Divide_and_Conquer([34, 18, 29, 10, 53, 41]) == 53
output: def find_max_Using_Divide_and_Conquer(arr):
      def find_max_rec(arr, left, right):
          if left == right:
              return arr[left]
          mid = (left + right) // 2
          left_max = find_max_rec(arr, left, mid)
          right_max = find_max_rec(arr, mid + 1, right)
          return max(left_max, right_max)
  
      return find_max_rec(arr, 0, len(arr) - 1)