I need help with my assignments..Problem 2 and problem 3 please

Problem 2. Construct the Huffman code for the C++ keywords and weights. words case class do else false for goto if int main static struct switch true while weights |15 18 5 10 4 22 1 20 20 22 2 3 6 4 12 . (max 30 points) Submission: Solve it by hand, scan your solution and submit it OR make respective drawing using MS Office as I did in the Lec11 Huffman. Note: If you do it by hand, make sure that your solution is not messy and is readable. Problem 3. Assume the A VL tree is initially empty. Do the following insertions into it and restore the AVL tree after each one: 40 30 20 60 50 80 15 28 25 (max 30 points) Submission: Solve it by hand, scan your solution and submit it OR make respective drawing using MS Office as I did in the Lec12_AVLTrees and ClassLab9_AVLTrees. Draw the results after each insertion of the new node and explain each step of solution in details. Note: If you do it by hand, make sure that your solution is not messy and is readable