What is a time complexity for finding the longest palindromic substring in a string by using the generalized suffix tree?

(a) Linear Time

(b) Exponential Time

(c) Logarithmic Time

(d) Cubic Time

The above asked question is from Suffix tree in section Trie of Data Structures & Algorithms I

I got this question in an online interview.