USING STRONG INDUCTION PLEASE STATE EACH PART CLEARLY AND EXPLAIN CLEARLY

Generalize your claim from the previous question to give a formula for the total number of calls to Merge-Sort (including the first) when we run Merge-Sort(A,p,r). (It will be a function of r - p.) Using strong induction, prove that your claim is correct. As with any proof by induction, you State the claim you want to prove. State and prove the base case. State the Induction hypothesis. Prove the induction step. Apply the induction principle to prove the claim you wanted