EXAMPLE 4 The following algorithm finds the number of binary digits in the binary representation of a positive decimal integer. ALGORITHM Binary(n) //Input: A positive decimal integer n //Output: The number of binary digits in n's binary representation count 1 while n > 1 do count count +1 [n/2] return count n Measure for input size? Basic operation? Number of time basic operation is repeated depends on the data? Summation term for worst- Running time of algorithm