input: Write a function to find the longest contiguous sequence of increasing numbers within an array. The function should return the longest increasing sequence as an array. If the array is empty, return an empty array.
  assert find_longest_increasing_sequence([3, 2, 1, 4, 5, 6, 7, 8])==[4, 5, 6, 7, 8]
  assert find_longest_increasing_sequence([1, 3, 2, 8, 9, 10])==[2, 8, 9, 10]
  assert find_longest_increasing_sequence([1])==[1]
  assert find_longest_increasing_sequence([])==[]
  assert find_longest_increasing_sequence([5, 4, 3, 2, 1])==[5]
output: def find_longest_increasing_sequence(arr):
      if not arr:
          return []
      max_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(max_seq):
                  max_seq = current_seq
              current_seq = [arr[i]]
      if len(current_seq) > len(max_seq):
          max_seq = current_seq
      return max_seq