Do not copy from other websites Correct and detailed answer will be Upvoted else downvoted. Thank you! A) Suppose we have an AVL tree that has 12 nodes, then the possible max height is: a. 3 b. 4 c. 5...

Do not copy from other websites

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

A)

Suppose we have an AVL tree that has 12 nodes, then the possible max height is:

a. 3

b. 4

c. 5

d. 6

e. none of above

B)

What is the time complexity of the algorithm below?

int sum = 0;

for (int i = 1; i < n;="" i*="">

  for (int j = 0; j < n;="">

    sum++;