3. 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) = 5T 6) + O(n) B: T(n) = 27 (29) + (n) C: T(n) = T (%) + 0 (na) Please give the running time of each algorithm (in notation), and which of your algorithms is the fastest (You probably can do this without a calculator)