In C++ We want to create strings with the following patterns for n = 0,1,2,3,4,5,6,7,... > n; cout <

In C++

We want to create strings with the following patterns for n = 0,1,2,3,4,5,6,7,... <-- empty string a ab abca abcadab abcadabeabca abcadabeabcafabcadab abcadabeabcafabcadabgabcadabeabca ... Define a recursive function string pattern2(int n) that returns the correct patterns for n = 0,1,2,3,4,5,6,7 and beyond. (Notice the relationship between a given line and the lines before it.) Hint: you'll need two recursive calls, somewhat like the code for Fibonacci. The current character, char('a' + (n-1)), is placed between the results of those calls. Don't worry about what happens when n gets big or goes beyond 26, your code will only be tested for small values of n.

The driver used to test your code is below:

string pattern2(int n); int main() { int n; cin >> n; cout <