Figure 4 Choose the figure that correctly implements the AVL tree from the non-AVL tree provided in the question.

Show the results of inserting the keys: F, L, O, R, I, D, A, U, N, V, M, Y, C, S in order into an empty B-tree with minimal degree 2. Draw only the configurations of the tree just before some node being split, and also draw the final configuration. Please make sure your tree configurations are drawn neatly and are easy to read and understand.  See attached image for how the tree configurations should be presented

What is a K-ary tree and what distinguishes it from general trees?

please answer all questions