Can someone please explain to me the solution to these 3 questions? This is an Algorithm analysis Course. Thanks

) Recurrence equations: Show your work for the following problems. | Use the Master's Method to determine the runtime of T(n) = 4T (-) + 0(n) O Use your solution from a) as your guess, then solve using the substitution method Draw a recursion tree for this recurrence, and *prove* how deep the tree is (i.e. the number of levels). Then, argue that the runtime matches the answers from the two above