you give table size 2 time n ie row n column consist integer 1 nin choose column j 1 le j le n swap value a_1 j a_2 j each column choose onceyour task find minimum number move require obtain permutation size n second row table determine impossible thatyou answer t independent test casesrecall permutation size n array size n contain integer 1 n exactly order element do not matter