Need a detailed step by step solution to this problem.

The following is a pseudocode of a function which takes an integer n greaterthanorequalto 0 as input. Function fno(n): if n == 0 then Return; end for i = 0 to n - 1 do Print'+'; end fno(n - 1); If T(n) is the number of times the above function prints a plus (+) when called with input n greaterthanorequalto 0. Find the exact value of T(n)? Use induction (preferably) to prove your