A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are ?1(?) = 3 ? log ? and ?2(?) = ? 6/5 a) Which algorithm is better? Why? b) If we run both algorithms at the same time with an input size of 105 which algorithm produces results faster than the other one? Why? Transcribed Image Text: 2) A computer science student designed two candidate algorithms for a problem while working

on his part-time job The time complexity of these two algorithms are

T,(n) = 3 n logn and T;(n) = n®/5 .

a) Which algorithm is better? Why?

b) If we run both algorithms at the same time with an input size of 105, which algorithm

produces results faster than the other one? Why?