Problem 5: For the following recurrences, state whether the master method applies. If so, supply the information requested; if not, state why it does not apply a) T(n) - 8T(n/4) n2 logrn Master method applies (Yes/No)? If no, then why not? If yes: Two expressions compared to determine whether it applies (give specific values using the above recurrence, not simply a copy of the Master Method definition): and If Case 1 or Case 3, supply a value of e that verifies a polynomial gap between these expressions:- Asymptotic complexity of recurrence Which takes asymptotically longer to execute: the work done at the root-node level of the recurrence, the work done by all other levels combined, or neither? b) T(n) 2T(n/2) - 2n Master method applies (Yes/No)? If no, then why not? If yes: Two expressions compared to determine whether it applies (give specific values using the above recurrence, not simply a copy of the Master Method definition): and If Case 1 or Case 3, supply a value of e that verifies a polynomial gap between these expressions Asymptotic complexity of recurrence: Which takes asymptotically longer to execute: the work done at the root-node level of the recurrence, the work done by all other levels combined, or neither? Problem 5: For the following recurrences, state whether the master method applies. If so, supply the information requested; if not, state why it does not apply a) T(n) - 8T(n/4) n2 logrn Master method applies (Yes/No)? If no, then why not? If yes: Two expressions compared to determine whether it applies (give specific values using the above recurrence, not simply a copy of the Master Method definition): and If Case 1 or Case 3, supply a value of e that verifies a polynomial gap between these expressions:- Asymptotic complexity of recurrence Which takes asymptotically longer to execute: the work done at the root-node level of the recurrence, the work done by all other levels combined, or neither? b) T(n) 2T(n/2) - 2n Master method applies (Yes/No)? If no, then why not? If yes: Two expressions compared to determine whether it applies (give specific values using the above recurrence, not simply a copy of the Master Method definition): and If Case 1 or Case 3, supply a value of e that verifies a polynomial gap between these expressions Asymptotic complexity of recurrence: Which takes asymptotically longer to execute: the work done at the root-node level of the recurrence, the work done by all other levels combined, or neither