input: Write a python function to find the intersection of two sorted arrays.
  assert array_intersection([1, 2, 3, 4, 5], [3, 5, 6]) == [3, 5]
  assert array_intersection([1, 1, 2, 2, 3, 4], [1, 1, 2, 3, 3, 5]) == [1, 1, 2, 3]
  assert array_intersection([], [1, 2, 3]) == []
  assert array_intersection([1, 2, 3], []) == []
  assert array_intersection([1, 2, 3], [4, 5, 6]) == []
output: def array_intersection(arr1, arr2):
      i, j = 0, 0
      intersection = []
      
      while i < len(arr1) and j < len(arr2):
          if arr1[i] < arr2[j]:
              i += 1
          elif arr1[i] > arr2[j]:
              j += 1
          else:
              intersection.append(arr1[i])
              i += 1
              j += 1
              
      return intersection