Super-Stooge Sort

What is the time complexity of a Super-Stooge Sort which recursively sorts the first 2/3 of the elements, then the last 2/3 of the elements, then the first 2/3 of the elements, then the last 2/3 of the elements? Please, include the explanation with the answer.

A) (n lg n) where lg is "log base 4"

B) (n lg n) where lg is "log base 3/2"

C) (n lg n) where lg is "log base 2/3"

D) (n ^ lg 4) where lg is "log base 2/3"

E) (n ^ lg 4) where lg is "log base 3/2"

F) (n ^ lg 3/2) where lg is "log base 4"