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"