derive the worst-case complexity of the following algorithm, given that the MethodAs complexity is n for an array of size n.

Void method (index low, index high)

{

index mid1, mid2;

if ( low < high) {

mid1 = (low + high)/3 ;

mid2 = 2* (low + high)/3 ;

method ( low, mid1);

method ( mid1 + 1, mid2);

method(mid2 + 1, high)

MethodA(low, mid1, mid2, high);

}

}