B"You are given an array a of length n , consisting of positive integers. You can perform the following operation on this array any number of times (possibly zero): Note that you can choose any integer as x , it doesn't have to be positive. You have to calculate the minimum number of operations to make the array a sorted in strictly ascending order (i. xe2 x80 x89e. the condition a_1 < a_2 < ... < a_n must be satisfied). The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains one integer n ( 1 <= n <= 2 cdot 10^5 ) -- the length of the array a . The second line of each test case contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ) -- the array a . Additional constraint on the input: the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, print one integer -- the minimum number of operations required to make a sorted in strictly ascending order. In the first test case, we can perform the operations as follows: In the second test case, we can perform one operation as follows: In the third test case, the array a is already sorted. "...