input: Write a python function to determine the minimum number of modifications required to transform an array of integers into a palindromic array. A palindromic array reads the same forward and backward. You can modify one element to any other in a single change.
  assert minimum_changes_to_palindrome([1,2,3,5,4,7,9,6]) == 4
  assert minimum_changes_to_palindrome([1, 2, 3, 4, 3, 2, 2]) == 1
  assert minimum_changes_to_palindrome([1, 4, 2]) == 1
  assert minimum_changes_to_palindrome([1, 4, 4, 2]) == 1
  assert minimum_changes_to_palindrome([1, 2, 3, 2, 1]) == 0
  assert minimum_changes_to_palindrome([3, 1, 1, 3]) == 0
  assert minimum_changes_to_palindrome([1]) == 0
  assert minimum_changes_to_palindrome([0, 1]) == 1
output: def minimum_changes_to_palindrome(arr):
      n = len(arr)
      left = 0
      right = n - 1
      changes = 0
  
      while left < right:
          if arr[left] != arr[right]:
              changes += 1
          left += 1
          right -= 1
  
      return changes