Which part of the following code snippet has the highest Big-O notation (O) time complexity?

{

int a = 12, s = 1, length;

for (int i = 0; i <= length; i++) a += i;

s += s * a;

}

• "s += s * a;"
• "int a = 12, s = 1, length;"