In java code

An increasing subarray of an integer array is any consecutive sequence of array integers whose values strictly increase. Write a Java function to count long subarrays (A) which accepts A=(a0,a1,,an1) of n>0 positive integers, and returns the number of longest increasing subarrays of A, i.e., the number of increasing subarrays with length (>1) at least as large as every other increasing subarray