Using divide and conquer, create an algorithm to solve the problem that follows. You can use R or Python to solve this problem. Include the asymptotic upper bound for your algorithm in your response (including the cost of subdivision and combining the results). You have a long string containing many characters (such as this paragraph), and you want to search for a substring within this string. For example, one may want to search for characters or want to or bstring wi or language. All but the last example should be found. Keep in mind that if you use divide and conquer to solve this problem there is one complication. The string to be found could be split between two of the sub-problems (assuming your algorithm divides the string into two smaller strings). Youll need to handle that case as well