Use back substitution method to compute the following recursive function, and check your results with the Master Theorem. Note that the final results must be presented as a function of n. Show at least three substitutions before moving to k steps, and all your work with summations to get credit. f(n)=27f(3n​)+n+1