[3 points] Draw an Adelson-Velskii and Landis (AVL) tree for the following nodes: 64,28, 51, 66, 15, 36, 74, 73, 12, 78, 82, 83, 86, 99, 21.Hint: No coding is involved with this problem. You need to draw the actual tree for this problem.When you draw your tree, it must an AVL tree instead of just a regular binary tree or binary search tree (BST). There are a few ways that you can arrange the layout for this tree;however, remember data within the tree must follow the rules of an AVL tree. I recommend that you first draw the tree with links and empty nodes. Then sort the items in the list and place them in the appropriate places within the tree so that it forms an AVL tree.(b) [2 points] Briefly explain the differences between a binary search tree and a regular binary tree. Which tree has a better advantage over the other? Briefly explain why.