code: def longest_increasing_subarray(arr):
      n = len(arr)
      longest = 0
      current = 1
      i = 1
  
      while i < n:
          if arr[i] < arr[i - 1]:
              longest = max(longest, current)
              current = 1
          else:
              current += 1
  
          i += 1
  
      # check again for max, maybe the last element is a part of the longest subarray
      return max(longest, current)
  
label_desc: Use image node_id 1 for calling a global function with example usage: longest_increasing_subarray(arr) and returns: max