Algorithm Analysis question

Given the following source code where n = number of data points: for( int i = 0; i < n16; ++i) { // cost for line? if( i <= 0) { // cost for line? i = 1; // cost for line? } else { // cost for line? i << 1 // cost for line? } sum += lg(i); // cost for line? }

Note << = bitshift e.g. [4)10 << 1] = [0100)2 << 1] -> 1000)2 = 8)10

Note recall law of logarithms and exponents. lg(x) = log2(x)| log(x) = log10(x) | ln(x) = loge(x) i++ is the same as i = i + 1; applied AFTER line is calculated ++i is the same as i = i + 1; applied before line is calculated Assign a cost to each line which will determine the cost function T(n): T(n) = ?