B'You are given an array of integers a_1, a_2, ldots, a_n . You need to make it non-decreasing with the minimum number of operations. In one operation, you do the following: An array b_1, b_2, ldots, b_n is non-decreasing if b_i <= q b_{i+1} for all 1 <= q i < n . Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. This is followed by their description. The first line of each test case contains an integer n ( 1 <= q n <= q 10^5 ) -- the size of the array a . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 10^9 ). It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output the minimum number of operations needed to make the array non-decreasing. No operations are needed in the first test case. In the second test case, we need to choose i = 2 , after which the array will be [2, 2] . In the third test case, we can apply the following operations: '...