Problem Statement In this problem, you will write a function that returns the count of a string$$s suffix in a given string, S$.$ A suffix is a combination of one or more symbols appended at the end of the string. You will be given the length, L of the suffix as a parameter to the function. Constraints S does not contain new line characters Length $($S$)>=$ L $>0$ Sample Input et tu$,$ brute $1$ Sample Output $2$ Explanation Input: Line $1$ denotes the string with no newline characters and Line $2$ denotes the length, L of the suffix Output: The suffix is $$e$$ and $$e$$ is present twice in string S$,$et tu$,$ brute$.$ Therefore, the count will be $2.$ the problem only ask as to write the method and I just wonder why my code kept giving me the length of the string? #include #include int suffixCount$($std::string S$,$ int L$)\{$ int count$=1$; std::string $*$arr $=$ new std::string$[$S$.$length$()]$; for $($int i$=0$;i