input: Write a function to find the longest increasing sequence in a list.
  assert find_longest_sequence([3, 10, 2, 1, 20]) == [3, 10, 20]
  assert find_longest_sequence([1, 2, 3, 4, 5, 6]) == [1, 2, 3, 4, 5, 6]
  assert find_longest_sequence([5, 4, 3, 2, 1]) == [5]
  assert find_longest_sequence([1, 2, 1, 2, 3, 1, 2, 3, 4]) == [1, 2, 3, 4]
output: def find_longest_sequence(arr):
      if not arr:
          return []
  
      n = len(arr)
      longest_seq = []
      current_seq = []
  
      for i in range(n):
          if not current_seq or arr[i] > current_seq[-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