Determine a function T(n) to describe the following algorithm using the exact analysis rules provided above. Mark the time used for each line and include for loop statements.

Sum = 0;

for (k = 1; k <= n; k = 2*k) {

for (j = 1; j <= n; j++) {

Sum++;

}

}