4. Identify the basic operation and construct C(n) that characterizes the time complexity of the algorithm. State the order of growth of C(n) using e notation. Foo4( n ) // Description: ... // Input: n is a positive integer // Output: ... co while (n > 1) do if n % 2 = 0 cfc + 1 ntn / 10 // This operation is integer division, i.e., floor(n/10) return c