For this Question: Given an unsorted array A[] of size N of positive integers. One number 'a' from set {1, 2, …N} is missing and one number 'b' occurs twice in an array. The task is to find the repeating and the smallest positive missing number.The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows. 
The first line of each test case contains a single integer N denoting the size of array. 
The second line contains N space-separated integers A(1), A(2), ..., A(N) denoting the elements of the array.

<b>Constraints:</b>
1 &le; T &le; 100
1 &le; N &le; 10^5
1 &le; A[i] &le; NFor each test case, in a new line, print b, which is the repeating number, followed by a, which is the smallest positive missing number, in a single line.Input:
2
2
2 2
3 
1 3 3

Output:
2 1
3 2

<b>Explanation:</b>
Testcase 1: Repeating number is 2 and the smallest positive missing number is 1.
Testcase 2: Repeating number is 3 and the smallest positive missing number is 2., I have written this Solution Code: t = int(input())


a = None
b = None

while t>0:

    n = int(input())
    arr = list (map(int ,input().split()))
    arr2 = [0] * (n+1)

    for i in arr:
        arr2[i] +=1


    for i in range(1, n+1):
        if arr2[i] == 0:
            b = i


        if arr2[i] == 2:
            a = i


    print(a,b)


    t -=1, In this Programming Language: Python, Now tell me if this Code is compilable or not?