Test Input Expected Got 1543521The elements stored in the first array are : 4 3 5 2 1↩The elements copied into the second array are : 4 3 5 2 14 3 5 2 1 4 3 5 2 1

Test Input Expected Got 1543521The elements stored in the first array are : 4 3 5 2 1↩The elements copied into the second array are : 4 3 5 2 14 3 5 2 1 4 3 5 2 1

Each test contains multiple test cases. The first line contains the number of test cases t𝑡 (1≤t≤1001≤𝑡≤100). The description of the test cases follows.The first line of each test case contains only one positive integer n𝑛 (1≤n≤1001≤𝑛≤100), representing the number of problems.The second line of each test case contains an array a𝑎 of length n𝑛 (1≤a1≤a2≤⋯≤an≤1091≤𝑎1≤𝑎2≤⋯≤𝑎𝑛≤109).The third line of each test case contains an array b𝑏 of length n𝑛 (1≤b1≤b2≤⋯≤bn≤1091≤𝑏1≤𝑏2≤⋯≤𝑏𝑛≤109).OutputFor each test case, print an integer as your answer in a new line.ExampleinputCopy261000 1400 2000 2000 2200 2700800 1200 1500 1800 2200 300064 5 6 7 8 91 2 3 4 5 6outputCopy23

Which of the following two arrays are copy-able?

Reverse first half and second half of the array.Input format :Size of the arrayArray elementsOutput format :Reversed arrayConstraints :1<=N<=100000Sample input1 2 3 4 7 8 6 5 4Sample output4 3 2 1 7 4 5 6 8ExplanationInput :71 2 3 4 5 6 7Output :3 2 1 7 6 5 4Note:Your code must be able to print the sample output from the provided sample input. However, your code is run against multiple hidden test cases. Therefore, your code must pass these hidden test cases to solve the problem statement.LimitsTime Limit: 5.0 sec(s) for each input fileMemory Limit: 256 MBSource Limit: 1024 KBScoringScore is assigned if any testcase passesAllowed LanguagesC

Sample Input 1:26 31 2 3 4 5 65 210 9 8 7 6Sample Output 1:1 2 3 4 6 510 9 8 6 7Explanation 1:For the first test case, Considering 0-based indexing we have M = 3 so the subarray[M+1 … N-1] has to be reversed.Therefore the required output will be {1, 2, 3, 4, 6, 5}.For the second test case, Considering 0-based indexing we have M = 2 so the subarray[M+1 … N-1] has to be reversed.Therefore the required output will be {10, 9, 8, 6, 7}.Sample Input 2:27 31 4 5 6 6 7 7 9 310 4 5 2 3 6 1 3 6Sample Output 2: 1 4 5 6 7 7 6 10 4 5 2 6 3 1 6 3