I have an assignment where i have to use a recursion method to print a pattern of asterisks.

Write a program, called RecursiveAsterisks, that has a recursive method called printAsterisk that takes an integer n as a parameter. The method should print a pattern of 2n lines of asterisks. The first line contains one asterisk, the next line contains 2, and so on up to the nth line which contains n asterisks. Line number n+1 again contains n asterisks, the next line has n-1 asterisks, and so on until line number 2n which has just one asterisk. Your main method should ask the user for the value of n. Below is an example of what would be displayed by the call printAsterisk(4).

*
**
***
****
****
***
**
How would i make it so that what ever n is currently equal to it prints that many asterisks?

Im pretty lost with recursion so..