Write the complexity of the following algorithm in Big-O notation: total - 1; FOR = 1 .. n FOR J = 0 .. 1 total = total = total + j END-FOR END-FOR Note: to indicate a power use A if it is log base 2, just use log if it is a square root, use sqrt