input: Write a function to find the longest contiguous sequence of increasing numbers within an array. This function should return the longest increasing sequence found in the array. If the array is empty, it should return an empty list.
  
  assert find_longest_increasing_sequence([3, 2, 1, 4, 5, 6, 7, 8]) == [4, 5, 6, 7, 8]
  assert find_longest_increasing_sequence([1, 2, 3, 0, 9, 10, 11, 12]) == [9, 10, 11, 12]
  assert find_longest_increasing_sequence([10, 20, 30, 5, 6, 7, 8]) == [5, 6, 7, 8]
  assert find_longest_increasing_sequence([8, 7, 6, 5, 4, 3]) == [4, 3]
  assert find_longest_increasing_sequence([]) == []
output: def find_longest_increasing_sequence(arr):
      if not arr:
          return []
      
      longest_seq = []
      current_seq = [arr[0]]
      
      for i in range(1, len(arr)):
          if arr[i] > arr[i-1]:
              current_seq.append(arr[i])
          else:
              if len(current_seq) > len(longest_seq):
                  longest_seq = current_seq
              current_seq = [arr[i]]
      
      if len(current_seq) > len(longest_seq):
          longest_seq = current_seq
      
      return longest_seq