Given an array of N integers Arr₁, Arr₂, ….Arr_N, count number of subarrays of Arr which are strictly increasing.
A subarray Arr_{[i, j]} is the array where 1 <= i < j <= N is a sequence of integers of Arr_i, Arr_i+1, ….Arr_j. A subarray Arr_{[i, j]} is strictly increasing if Arr_i < Arr_i+1 < Arr_i+2 < ……. < Arr_j.

Example 1:

Input: 
N = 6
Arr[] = {1, 3, 3, 2, 3, 5}
Output: 4
Explanation:
(1,3), (2, 3), (3, 5) and (2, 3, 5)
are the only increasing subarrays.

Example 2:

Input: 
N = 2
Arr[] = {1 5} 
Output: 1
Explanation:(1, 5) is the only increasing
subarray.

Your Task:
You don't need to read input or print anything. Your task is to complete the function countIncreasing() which takes the array of integers arr[] and n as parameters and returns a integer denoting the answer.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

Constraints:
1 <= N <= 10⁷
1 <= Arr_i <= 10⁷