![2. Recurrence trees [10 points] Solve each of the problems below by building a recurrence tree reflecting the amount of computation that occurs at every stage of the algorithm, and using it to derive a closed form (a) (5 points) if n <3 T(n) - 3.T㈜ +1 if n > 3](../../../media.cheggcdn.com/media/310/310c6537-f04e-453a-ad8c-213504c4aa5e/php3LQ2Ny.png)
2. Recurrence trees [10 points] Solve each of the problems below by building a recurrence tree reflecting the amount of computation that occurs at every stage of the algorithm, and using it to derive a closed form (a) (5 points) if n <3
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured