Please all steps.. Thank you for your time!

Step 1 Show, using Substitution method, that the solution to the following recurrence is not O(n) : T(n)=4T(2n+2)+n Step2 - The general form of the sum of all nodes at a given level - Based on the above two pieces of information, come up with a guess for terms in the tree are, i.e. at the top or at the bottom, and go with those. Step3 s. "sloppy" application of master method, come up with another guess for the runtime! Step4