Indicate for each of the statements below whether the statementis true or false. You do not need to show your work a) T(N) =T(N/2) + 100 is in O(N) b) log log (N + N) + log2N is in O(log2N)c)buildHeap() is in O(NlogN) d) buildHeap() is in O(N) e) Findingthe kth largest item in an AVL tree containing N elements (worstcase) is in O(N)
Expert Answer
An answer will be send to you shortly. . . . .