Question

Problem 3. Find the exact solutions to the following recurrences and prove your solutions using induction 1, T(1) = 5 and T(n) T(n-1) + 7 for all n > 1. 2. T (1)-3 and T(n)-2T(n-1).

Answer 1

Tan Psoof vic induction Ste base case Let's Aind out the solof given secuspene ら given ue. says TC)-S so, ous sonbeafe ccase Assuming for any k >I step 3 lǐleea) i se ecom saythat veil Pove the solution via induction ord Buccordng to our sol

page 2 Let's fst umdesterrd cohert this secukience meains 1(m) TCI) T(3) =(2) (TC2) (2) C) (3) t(2) (22 3) 9o, ave con yuess +hert sol? could be as (2) aoe ill check cohethes t ll cissume anat fos osiarury k, o he heise cose vaalue given in tne questiom us solution ts Aue to get TC+)isecussence poovided in tne questlon coe oill catlt ase coilltoy to get TCr4) via ous soluton. wwe oillc b -rp aJ and Cb] age equalム-then the solution (seve founs out. is cosree

onhase case seys, C Ous solution prge 3 冫3 ous solution mertr hes ith the qweston step 1 pass Gep 2 ssuming foom ous solution re 3」 /Seconding to Question TK)) ド-| )(3 so, the solutton tnert odlve fouro ouut fos given seee is tue Coa

Hope this will help.