To solve a problem with input size N by divide and conquer algorithm, among the following methods, __ is the worst.

A、divideinto2sub-problemsofequalcomplexityN/3andconquerinO(N)
B、divideinto2sub-problemsofequalcomplexityN/3andconquerinO(NlogN)
C、divideinto3sub-problemsofequalcomplexityN/2andconquerinO(N)
D、divideinto3sub-problemsofequalcomplexityN/3andconquerinO(NlogN)