title : C++ language

Math Challenge Have the function Mathehallenge (str) take the str 12#includeiostream#includestring parameter being passed and 3 using namespace std; determine if there is some substring K that can be repeated N>1 times to string MathChallenge(string str) \{ produce the input string exactly as it 7// code goes here appears. Your program should return 8 return str; the longest substring K, and if there is none it should return the string 1. 3 abcxabc int main(void) \{ For example: if str is "abcababcababcab" then your 1415 // keep this function call here program should return abcab because 16 return ; that is the longest substring that is repeated 3 times to create the final 18 string. Another example: if str is "abababababab" then your program should return ababab because it is the longest substring. If the input string contains only a single