write a go solution for B. Minimise Onenesstime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFor an arbitrary binary string t^∗, let f(t) be the number of non-empty subsequences^† of t that contain only mathtt0, and let g(t) be the number of non-empty subsequences of t that contain at least one mathtt1. Note that for f(t) and for g(t), each subsequence is counted as many times as it appears in t. E.g., f(mathtt000)=7,g(mathtt100)=4.We define the oneness of the binary string t to be |f(t)-g(t)|, where for an arbitrary integer z, |z| represents the absolute value of z.You are given a positive integer n. Find a binary string s of length n such that its oneness is as small as possible. If there are multiple strings, you can print any of them.^∗A binary string is a string that only consists of characters texttt0 and texttt1.^†A sequence a is a subsequence of a sequence b if a can be obtained from b by the deletion of several (possibly, zero or all) elements. For example, subsequences of mathtt1011101 are mathtt0, mathtt1, mathtt11111, mathtt0111, but not mathtt000 nor mathtt11100.InputThe first line contains an integer t (1<=t<=10^4) — the number of test cases.The only line of each test case contains an integer n (1<=n<=2*10^5) — the length of s.It is guaranteed that the sum of n over all test cases does not exceed 2*10^5. OutputFor each test case, output s on a new line. If multiple answers exist, output any.ExampleInput3123Output0
01
010
NoteIn the first test case, for the example output, f(t)=1 because there is one subsequence that contains only mathtt0 (mathtt0), and g(t)=0 because there are no subsequences that contain at least one 1. The oneness is |1-0|=1. The output mathtt1 is correct as well because its oneness is |0-1|=1.For the example output of the second test case, f(t)=1 because there is one non-empty subsequence that contains only mathtt0, and g(t)=2 because there are two non-empty subsequences that contain at least one mathtt1 (mathtt01 and mathtt1). The oneness is thus |1-2|=1. It can be shown that 1 is the minimum possible value of its oneness over all possible binary strings of size 2.. Output only the code with no comments, explanation, or additional text.