4. (2 marks) Consider the following algorithm. Using big-O notation, what is the running time of this algorithm? Give a very brief explanation. Algorithm D Input: a positive integer n while n > 0 print n nt ( n/2 ] Reminder: [] represents the floor of a real number (the largest integer that is less than or equal to that real number). For example, [11.5] = 11 and [5] = 5