(20 points) use the master theorem to solve the following recurrence relations. for each recurrence, either give the asympotic solution using the master theorem (state which case), or else state the master theorem doesn’t apply.(a) t(n)=t(3n)+2 4(b) t(n)=3t(n)+nlgn 4(c) t(n)=8t(n)+2n 3(d) t(n)=t(n)+t(n)+n2 24(e) t(n)=100t(n)+lgn

Best answer that i found on yahoo ok   set :   x= length of 2nd piece in cm  x- 3= length of 1st piece in cm  x-4= length of 3rd piece in cm  then since you know they all came from the 20 cm ribbon you add them together and set them equal to 20x+ x-3 +x-4 = 20  3x - 7= 20  3x= 27  x= 9  the shortest piece is the third piece which is x- 4  x-4  9-4 = 5  the length of the smallest piece is 5 cm.  the other lengths are  9 cm  6 cm

Two because two of one thing is two.