Algorithm Analysis question:

Determine the cost function T(n) of the following code fragment. Hint. Assume worst case for numeric choices.

// bool TEST is defined and set by external process before executing this function. It will either be TRUE or FALSE at the start of this function and may change in the middle of execution.

for(int i = 0; i < n; ++i) {

if( TEST) {

for( int j = 0; j < n; ++j) {

score += i+j;

}

} else {

score += i*j;

}

}

Assume operator ^ takes a fixed constant amount of time.

REQUIRED: Show line by line costs of T(n) and final T(n).

What is the final order of growth expression with asymptotic assumptions in terms of O(...)?