At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions.

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions

So, T(n)=3T(n-2)+2T(n-1)?

may i know how you got that

check this
http://math.stackexchange.com/questions/614356/difficult-recursion-problem

I checked that out before posting it here. Don't really understand it completely.

suppose \(n=1\), how many ways can you schedule \(1\) day ?

you can either `study` or `play`, so only \(2\) ways, yes ?

that means
\[T(1)=2\]

next let \(n=2\) and work the number of ways \(2\) days can be scheduled

no idea how you can even solve this its more of an opinion than a math question.