input: Write a python function to find two numbers in an array that sum to a given target using brute force search algorithm.
  assert brute_force_search([1, 3, 4, 5, 6, 7], 8) == (3, 5)
  assert brute_force_search([10, 20, 30, 40, 50], 70) == (20, 50)
  assert brute_force_search([2, 4, 6, 8, 10], 16) == (6, 10)
output: def brute_force_search(arr, target):
      for i in range(len(arr)):
          for j in range(i + 1, len(arr)):
              if arr[i] + arr[j] == target:
                  return (arr[i], arr[j])