input: Write a python function to find the longest increasing subarray.
  assert find_longest_increasing_subarray([1, 2, 2, 4, 5, 6])==([4, 5, 6], 3)
  assert find_longest_increasing_subarray([5, 6, 3, 5, 7, 8, 9, 1, 2])==([5, 7, 8, 9], 4)
  assert find_longest_increasing_subarray([10, 20, 30, 10, 40, 50, 60])==([10, 20, 30], 3)
output: def find_longest_increasing_subarray(arr):
      if not arr:
          return ([], 0)
      
      max_length = 1
      current_length = 1
      start_index = 0
      best_start_index = 0
      
      for i in range(1, arr.length):
          if arr[i] > arr[i-1]:
              current_length += 1
              if current_length > max_length:
                  max_length = current_length
                  best_start_index = start_index
          else:
              current_length = 1
              start_index = i
      
      return (arr[best_start_index:best_start_index + max_length], max_length)