5.[8 Points] Given an algorithm that determines the number of 1 bits in the bit string S, determine the time complexity of the algorithm:

procedure bit count (S: bit string) count: = 0

while S 0

count: = count+1

S: = S (S1)

return count {count is the number of 1s in S}

Here S1 is the bit string obtained by changing the rightmost 1 bit of S to a 0 and all the 0 bits to the right of this to 1s. [Note: the step "S: = S (S1)" performs the bitwise AND operation of S and S1.]