$5)$

A: Provide a list of ten elements in insertion order, to a binary tree that is an example of a degenerate tree with O$($N$)$ search performance after all elements are inserted. Explain why this happens, and suggest an alternative insertion order that archives O$($log$2$N$)$ search efficiency. Draw both of the resulting trees.

B: Draw the binary search tree whose elements are inserted in the following order:

$17,11,22,5,13,19,20$

Is the resulting tree an AVL tree? explain why or why not.