Pyramid Pattern Challenge

You are given a number of test cases. For each test case, an integer N is provided. Your task is to generate a pyramid pattern of asterisks for each test case. For a number N, the pyramid consists of N rows where the i-th row contains exactly i asterisks (*). The pyramids of different test cases should be separated by an empty line.

For example, if N = 3, the output should be:

\(\ast\)
\(\ast\ast\)
\(\ast\ast\ast\)

All input is read from standard input and all output should be written to standard output.

inputFormat

The first line contains an integer T indicating the number of test cases. Each of the next T lines contains an integer N representing the number of rows for the pyramid pattern for that test case.

Input Format:

T
N1
N2
...
NT

outputFormat

For each test case, output the corresponding pyramid pattern. Each row in the pyramid should consist of asterisks (*) with the count equal to the row number. Separate the pyramid of each test case by an empty line.

Output Format:

(pyramid for first test case)
(pyramid for second test case)
...
(pyramid for T-th test case)

## sample</p>

2
1
2

*



**

</p>