This is a python problem.

(8 points) Write a recursive function called count pattern with a single parameter astr, which is a string. The function returns the number of times the substring "ou" appears in the string. The base case occurs when the string has length 2 or less. For exam- ple, count-pattern ("house mouse louse") should return 3 and count -pattern("true blue") should return 0. Once again, your function should consist only of the base case and recursive calls. Again, no loops! Do not use an len, or the string operators and for indexing and slicing, respectively