Examine this pattern of asterisks and blanks, and write a recursive function called pattern() that can generate patterns such as this: k t With recursive thinking, the function needs only seven or eight lines of code (including two recursive calls). Your function prototype should look like this: // Description: // The longest line of the pattern has n stars beginning in column i of the output. // For example, the above pattern is produced by the call pattern(8, 0) // Precondition: n is a power of 2 greater than zero // Postcondition: A pattern based on the above example has been printed. void pattern(int n, int i); Hint: Think about how the pattern is a fractal. Can you find two smaller versions of the pattern within the large pattern? Here is some code that may be useful within your method // loop to print exactly i spaces: for (k-0; k