For some algorithm f(n), let T(n) be the time f(n) takes. Also, let T(n) be defined as the following: T(1)=1, if n==1; T(n)=3T(n/3)+n, for n>1 and n is a power of 3 . Solve T(n) for n is a power of two by using the repeated substitution method. You can work on a paper and submit an image of it