T(n)=c if n=1 =2T(n-1)+d if n>1 Find the value of T(n) and thus the time complexity. My attempt at it got stuck. T(n)=4T(n-2)+3d T(n)=8T(n-3)+7d .. .. .. T(n)=8T(n-k)+7d It can't be solved further.