, = }, determine the exact number of basic operations that would be performed when the following function foo is invoked on each value of ni. Contest ends in 9 hours Submissions: 92 Max Score: 25 Difficulty: Medium def bar (k): count = 0 for i in range (2, k): for j in range(1, i): if i j = 0 count = count + 1 else: count = count - 1 return count Rate This Challenge: More def foo(n): if n == 0 : return 1 elif n % 3 == 0: v = foo (n // 3) t = 0 for i in range(n): t = t + V return t elif n % 3 == 1: v = foo (n - 1) return v + bar (n) else: v = foo (n - 2) + foo (n - 2) return V + 1 Input Format