Please

let me know

Please answer all the questions

1. [10 Points] Fill in the following table. For the last column, you are to assume that your goal is to pick the fastest algorithm (based on the worst-case running time) with A, having worst-case time complexity of Ti(n) and A2 having worst case time complexity of T2(n). In addition to the table, please give us a very brief explanation for how you determined your answer. T2(n) is Ti(n) = 0[Tz(n)) Tin) Which is best? Xin log2 n 25n In n + Sn (where in is natural log) % n + n log2 n 5n log2 n Vn log2 n c. 2n2 d. 2 logen nvn asymtotic time complexity of the