input: Write a python function to find and print the longest sequence of increasing numbers.
  assert printLongestIncreasingSequence([5, 3, 4, 8, 6, 7]) == [3, 4]
  assert printLongestIncreasingSequence([1, 2, 3, 4, 5, 6]) == [1, 2, 3, 4, 5, 6]
  assert printLongestIncreasingSequence([10, 9, 8, 7, 6, 5]) == [10]
output: def printLongestIncreasingSequence(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