Please post answer with all steps and work shown so that I can follow your logic. Thanks!!

C Ocs.mcgill.ca-hatami/cornp251-1201 //files/hw4.pdf ::: Apps maths her d Str cks R Fornok Mccil Mail p Gongle erp " mrvesu gestons converter YouTube Nrtfix nMixraad sounenud GRIN and Sell Mens pebast O Home nds aion deas with each other, but each student must find and write his/her own solution. You should upload he pdf file (either typed, or a clear scan) of your solution to mycourses 1. (15 points) In this question you are going to prove the so called Master Theorem for divide and conquer algorithms. The proof is stated in several books and webpages, but you are required (and encouraged) to prove this by yourself without looking it up. Let a,b > 0 be integers and c, d > 0 be real numbers. Let -logba. Suppose that T(1) c, and for every n divisible by b, we have the recursion T(n)-aT(n/b) + cnd. By using induction prove that for nbmwhere m N, we have If d T(n) (nd) . . . then 2. We are given a sequence of positive integers a1, ..., an corresponding to the prices of a stock Show all 0 .coMP 250 "Downloads e Google Chr.. " ahw1 (1),pdt..aQuestion 2...-Spotify ^q4)1ma Type here to search D