If comparison based sorting algorithm is used construct the suffix array, then what will be time required to construct the suffix array?

If comparison based sorting algorithm is used construct the suffix arr

1.	If comparison based sorting algorithm is used construct the suffix array, then what will be time required to construct the suffix array?
A.	O(nlogn)
B.	O(n2)
C.	O(n2logn)
D.	O(n2) + O(logn)
Answer» D. O(n2) + O(logn)