You should complete the function and ensure it produces the correct output against all test cases possible within the constraints highlighted. The runtime of the program is important so it is best to use an algorithm in the code which will not timeout

Time Complexity - Recursion v2 Problem Submissions Leaderboard Discussions Given t queries: n..., n, counting only { +, -, *.//.%, >, = ), determine the exact number of basic operations that would be performed when the following function foo is invoked on each value of n. Contest ends in 5 days Submissions: 0 Max Score: 25 Difficulty: Medium Rate This Challenge: def bar(k): count = 0 for i in range(2, k): for j in range(1, i): if i j == G: count = count + 1 else: count = count - 1 return count More def foo (n): if n 0 : return 1 elifns 3 = 0; v = foon // 3) t = @ for i in range(n): tut + return t elif n3 == 1: v = foon - 1) return v + barn) else: v = foon - 2) + foon - 2) return V + 1 Input Format A line containing the integer t Each of the next t lines contains a single integer ne Constraints 1, = ), determine the exact number of basic operations that would be performed when the following function foo is invoked on each value of n. Contest ends in 5 days Submissions: 0 Max Score: 25 Difficulty: Medium Rate This Challenge: def bar(k): count = 0 for i in range(2, k): for j in range(1, i): if i j == G: count = count + 1 else: count = count - 1 return count More def foo (n): if n 0 : return 1 elifns 3 = 0; v = foon // 3) t = @ for i in range(n): tut + return t elif n3 == 1: v = foon - 1) return v + barn) else: v = foon - 2) + foon - 2) return V + 1 Input Format A line containing the integer t Each of the next t lines contains a single integer ne Constraints 1