please help with homework

The running times of two algorithms are described by the recurrences below. Rank the algorithms by speed (not the recurrences by order of growth). If the two algorithms have the same (asymptotic) speed, write EQUAL. SHOW WORK! Be sure to indicate which is fastest in your list. (2 points each) +Ign T, (n)-5708Tlgn 202 111 T,(n)-47, 1+n--(12.71)2 T,(n)-2701-(1.6179). To (n)- 27,16179) where T (0) 0, T(1) 1, To (2) 1