Consider the problem of construction of minimum cost binary search tree for a given set of 'n' identifiers with their respective probabilities.The time complexity of the most efficient algorithm of the same is___
A)0(n^2) B)0(n^3)
C)0(nlogn) D)0((n^3)logn)