What is the Big-O worst-case runtime of searching an AVL tree with n x 2" nodes? O a.O(n) Ob.0(n x logn) O.O(logn) O d.0(n x 2") QUESTION 16 What is the formula to find the index of the parent of a...

Correct and detailed answer will be Upvoted else downvoted. Thank you!

Extracted text: What is the Big-O worst-case runtime of searching an AVL tree with n x 2" nodes? O a.O(n) Ob.0(n x logn) O.O(logn) O d.0(n x 2") QUESTION 16 What is the formula to find the index of the parent of a certain node of index i in a min-heap? Oa. (i-1) 4 Ob. Floor() O. No formula can be used to find the index of the parent node Od. "ceiling() QUESTION 17 What is the number of levels of a fully-balanced Binary Tree with 16 leaves? а. 5 ОБ.16 Oc. 8 O d.6