4. You have three algorithms to a problem and you do not know their efficiency, but...

Transcribed Image Text:

4. You have three algorithms to a problem and you do not know their efficiency, but fortunately, you find the recurrence formulas for each solution, which are shown as follows: A: T(n) = 2T() + O(n) B: T(n) = 2T() + O(n) C:T(n) = 2T() + O(n) Please give the running time of each algorithm (In 0 notation), and which of your algorithms is the fastest (You probably can do this without a calculator)? 4. You have three algorithms to a problem and you do not know their efficiency, but fortunately, you find the recurrence formulas for each solution, which are shown as follows: A: T(n) = 2T() + O(n) B: T(n) = 2T() + O(n) C:T(n) = 2T() + O(n) Please give the running time of each algorithm (In 0 notation), and which of your algorithms is the fastest (You probably can do this without a calculator)?