What is a time complexity for finding frequently occurring of a substring of minimum length in a string?

• A. Ɵ (n)
• B. Ɵ (n!)
• C. O (n2+ n1)
• D. O (log n!)