input: Write a python function to find the longest increasing sequence in an array.
  assert find_longest_increasing_sequence([1, 2, 3, 4, 5]) == 5
  assert find_longest_increasing_sequence([5, 1, 2, 3, 4]) == 4
  assert find_longest_increasing_sequence([1, 2, 1, 2, 3, 4]) == 4
output: def find_longest_increasing_sequence(arr):
      if not arr:
          return 0
  
      longest = 1
      current_length = 1
  
      for i in range(1, arr.length):
          if arr[i] > arr[i - 1]:
              current_length += 1
              longest = max(longest, current_length)
          else:
              current_length = 1
  
      return longest