Solve the recurrence T(n) = 3T(n-1) +1, with T(0) = 2 1. As a 1rst-order linear recurrence.

Related Book For  answer-question

Algorithm Design And Applications

ISBN: 9781118335918

1st Edition

Authors: Michael T. Goodrich, Roberto Tamassia

Posted Date: