Examine this pattern of asterisks and blanks, and write a recursive method that can generate patterns such as this: With recursive thinking, the method needs only seven or eight lines of code (including two recursive calls). Your method should have the following specification and header://Parameters: n and i are integers//Precondition: n is a power of 2, n >- 1, i>- 0//Post condition: A pattern based on the above example has been//printed. The longest line of the pattern has/ stars beginning in column i of the output. For example, //The above pattern is produced by the call pattern(8, 0). public static void pattern(int n, int i)//A loop to print exactly i spaces: for (k - 0; k