input: Write a function to find the longest contiguous sequence of increasing numbers within an array. If the array is empty, 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([10, 22, 9, 33, 21, 50, 41, 60, 80])==[10, 22, 33, 50]
  assert find_longest_increasing_sequence([5, 4, 3, 2, 1])==[5]
  assert find_longest_increasing_sequence([1, 3, 5, 4, 7])==[1, 3, 5]
  assert find_longest_increasing_sequence([])==[]
output: 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