write a go solution for C. 23 Kingdomtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output The distance of a value x in an array c, denoted as d_x(c), is defined as the largest gap between any two occurrences of x in c. Formally, d_x(c)=max(j-i) over all pairs i<j where c_i=c_j=x. If x appears only once or not at all in c, then d_x(c)=0. The beauty of an array is the sum of the distances of each distinct value in the array. Formally, the beauty of an array c is equal to sumlimits_1<=x<=nd_x(c).Given an array a of length n, an array b is nice if it also has length n and its elements satisfy 1<=b_i<=a_i for all 1<=i<=n. Your task is to find the maximum possible beauty of any nice array.InputEach test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^4). The description of the test cases follows. The first line of each test case contains a single integer n (1<=n<=2*10^5) — the length of array a.The second line of each test case contains n integers a_1,a_2,ldots,a_n (1<=a_i<=n) — the elements of array a.It is guaranteed that the sum of n over all test cases does not exceed 2*10^5. OutputFor each test case, output a single integer representing the maximum possible beauty among all nice arrays.ExampleInput441 2 1 222 2101 2 1 5 1 2 2 1 1 281 5 2 8 4 1 4 2Output4
1
16
16
NoteIn the first test case, if b=[1,2,1,2], then d_1(b)=3-1=2 and d_2(b)=4-2=2, resulting in a beauty of 2+2=4. It can be proven that there are no nice arrays with a beauty greater than 4.In the second test case, both b=[1,1] and b=[2,2] are valid solutions with a beauty of 1.In the third test case, if b=[1,2,1,4,1,2,1,1,1,2] with d_1(b)=9-1=8, d_2(b)=10-2=8, and d_4(b)=0, resulting in a beauty of 16.. Output only the code with no comments, explanation, or additional text.