某算法的时间复杂度递推式为 T(n)=T(n2)+O(n2)T(n)=T(\dfrac{n}{2})+O(n^2)T(n)=T(2n)+O(n2),请问其时间复杂度。
A.O(n)O(n)O(n) B. O(n2logn)O(n^2logn)O(n2logn) C.O(n2log2n)O(n^2\log^2 n)O(n2log2n) D. O(n2)O(n^2)O(n2)