Match the time complexities of Naive, KMP and Rabin Karp string matching algorithms where ‘m’ is the length of the string and ‘n’ is the length of the text.

1.       Naive                          a. O(m+n)

2.       KMP                            b. O(n)

3.       Rabin Karp                c. O(mn)