What is a time complexity for finding the longest substring that is repeated in a string?

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