write a go solution for F. Array Reductiontime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a containing n integers. In one operation, you can choose some elements from this array and remove them. However, the elements you choose must meet one of the following conditions:  either all chosen elements are equal;  or there are no two equal chosen elements. Note that if you choose only 1 element to remove, it automatically meets these conditions.For example, if a=1,2,1,1,3, some of the possible elements you can remove in one operation are:  the 1-st element;  the 1-st and the 3-rd element;  the 1-st, the 3-rd and the 4-th element;  the 3-rd and the 4-th element;  the 2-nd, the 4-th and the 5-th element;  and many others. However, you cannot choose the 2-nd, the 3-rd and the 4-th element because the 2-nd element is not equal to the 4-th, but the 3-rd element is equal to the 4-th.For each x from 0 to n-1, you have to calculate the minimum number of operations required to decrease the size of the array to exactly x.InputThe first line contains one integer t (1<=t<=10^4) — the number of test cases.Each test case consists of two lines:  the first line contains one integer n (1<=n<=3*10^5) — the size of the array;  the second line contains n integers a_1,a_2,...,a_n (1<=a_i<=n) — the array itself. Additional constraint on the input: the sum of n over all test cases does not exceed 3*10^5.OutputFor each test case, print n integers c_0,c_1,...,c_n-1, where c_i is the minimum number of operations required to reduce the size of the array to exactly i.ExampleInput5115 5 5 5 2 2 2 8 6 1 763 3 3 3 3 352 1 3 5 481 1 1 2 3 4 5 611Output3 3 2 2 2 1 1 1 1 1 1 
1 1 1 1 1 1 
1 1 1 1 1 
2 2 1 1 1 1 1 1 
1 
NoteIn the first example, the answer can be obtained as follows:  c_0=3: remove a_8,a_9,a_10,a_11; then remove a_1,a_2,a_3,a_4; then remove a_5,a_6,a_7;  c_1=3: remove a_8,a_9,a_10,a_11; then remove a_1,a_2,a_3,a_4; then remove a_5,a_6;  c_2=2: remove a_7,a_8,a_9,a_10,a_11; then remove a_1,a_2,a_3,a_4;  c_3=2: remove a_7,a_8,a_9,a_10,a_11; then remove a_1,a_2,a_3;  c_4=2: remove a_7,a_8,a_9,a_10,a_11; then remove a_1,a_2;  c_5=1: remove a_1,a_7,a_8,a_9,a_10,a_11;  c_6=1: remove a_7,a_8,a_9,a_10,a_11;  c_7=1: remove a_1,a_2,a_3,a_4;  c_8=1: remove a_1,a_2,a_3;  c_9=1: remove a_1,a_2;  c_10=1: remove a_7;. Output only the code with no comments, explanation, or additional text.