Q2. (10 points) Consider the following pseudo-code which takes the integer n 2 0 as input: Function bar (n) Print if n0 then end Return: bar (1) end Let T(n) be the number of times the above function prints a star () when called with input n 0. What is T(n) exactly, in terms of only n (and not values like T(n-1) or T(n - 2))? Prove your statement