Recursion:

Given a string x, a substring m from x and a number n, write a recursive method (no loops) to check if at least n copies of the substring m appear in the string x. You should call your method checkForSub(). The method checkForSub() should take in 2 strings and an integer value and return a boolean.

For Example:

checkForSub("catcowcat", "cat", 2) → true

checkForSub("catcowcat", "cow", 2) → false

checkForSub("catcowcat", "cow", 1) → true

Test cases:

-----

Input:

x m n, where x and m are Strings, n is an integer

Sample Input:

catcowcat cat 2

Output:

A Boolean value

Sample Output:

true

-----