Please Design algorithm in C, please give the Algorithm analysis, complexity must O(n) with a problem :

- Input: string in a line, Output: please print the pattern & repeated count if there's a repeated pattern, Print "none" otherwise. NOTE: algorithm for string matching, Repeated pattern rightful only from first character.

In a string, we can have repeated pattern. Example: Input Output abc none abaa none (a) 4 abab (ab) 2 abcabc (abc) 2 ababacababac (ab) 2 ababacababacababac (ababac) 3 In a string, we can have repeated pattern. Example: Input Output abc none abaa none (a) 4 abab (ab) 2 abcabc (abc) 2 ababacababac (ab) 2 ababacababacababac (ababac) 3