Problem 3 - AB Equality Create a recursive function in a file called ab_equality.py: def ab equalín, k, current) Print out all of the strings of a's and b's of length n so that the number of a's and b's are equal. For n = 2, there's ab and ba. For n = 3 there are no strings since they'd have to have 2 a's and lb, or 2 b's a la so not equal. For n = 4, there will be 6 of these strings, and for n = 5, zero again. Hint: use k to track the difference between a's and b's. So for instance if your current is aaabb then k should be equal to either 1 or -1 (your choice depending). When you call the function, you should call it from your main or testing function with the length in the n parameter, O should be put into the k parameter, and then an empty string will be passed in for current. What length do you want to run? 4 aabb abab abba baab baba bbaa linux5[110] % python3 ab_equality.py What length do you want to run? 6 aaabbb aababb aabbab aabbba abaabb ababab ababba abbaab abbaba abbbaa baaabb baabab baabba babaab bababa babbaa bbaaab bbaaba bbabaa bbbaaa

How is life in presidios, missions, pueblos and ranchos alike and different

Is the house in planes trains and automobiles the same as home alone?

What does the statement “I have no political efficacy” mean

Which of the following is an example of American imperialism?