(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 0, and appropriately to receive full marks. Algorithm Ex3 (T,c) T is a balanced binary search tree containing integer number values and c is an integer. Each node in T has two child nodes, either a numeric value or the value null to indicate the lack of a child value. node root(T) while (node != null) if node. value ==c return true else if c