need it within 30 min, plz

(c) Precisely specify the conditions under which the following algorithm returns True, and then discuss, in detail, the running time of the algorithm. If you think it has different best- and worst-case running times then these should be considered separately, and you should explain the conditions under which best and worst-cases arise. You must fully explain your answer and use o, and appropriately to receive full marks. Algorithm Ex3 (TT, cc) TT is a balanced binary search tree containing integer number values and cc is an integer. Each node in TT has two child nodes, either a numeric value or the value nnttffff to indicate the lack of a child value. nnnnnntt ttnnnntt(TT) ffnnttnnnn ffaafffftt while (nnnnnntt != nnttffff) aannnn (ffnnttnnnn == ffaafffftt) if nnnnnntt. vvaafftttt == CC ffnnttnnnnttttttttt else if cc