a) Build an AVL tree by inserting the following values in the given order:
5, 10, 15, 20, 25, 23, 21, 19, 17, 16
b) Redraw the above AVL tree after deletion of some nodes in the following order: 15, 21, 17, 5, 10 Note: Each step of insertion, deletion and rotation is required in pictorial form.