Consider these characters (from left to right): "C", "O", "P", "Y", "R", "I", "G", "H", "T". a Construct an AVL tree by inserting the characters above one by one: (1) showing the AVL tree after each character insertion, and (2) listing each rotation performed with its type and the pivot nodes (15 points). b Construct a 2-3 tree by inserting the characters above one by one: (1) showing the 2-3 tree after each character insertion, and (2) including all temporary 4 nodes created and their necessary splits (15 points). Note Use the alphabetical order of letters to sort characters.