Complexity Analysis - General Questions

Which is true for large n?

An algorithm that uses a fixed amount of extra memory regardless of input size has space complexity:

Amortised analysis gives:

Which grows fastest as n increases?

What is the output of the following code?

count = 0
n = 16
i = n
while i > 1:
    i //= 2
    count += 1
print(count)