B'You have an array of integers a of length n . You can apply the following operation to the given array: Determine whether it is possible to sort the array in non-decreasing order by performing the operation any number of times (possibly zero). For example, let a = [ 7, 10, 1, 3, 2 ]. Then we can perform 3 operations to sort the array: The first line of input data contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains one integer n ( 1 <= n <= 2 cdot 10^5 ) -- the length of array a . The second line of each test case contains exactly n positive integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ) -- the elements of array a . It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output on a separate line: You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as positive response). The first test case is explained in the problem statement. '...