7 Analysis 19. (4 points) How would a Huffman Tree look if all the frequencies of the symbols were equal? 20. (4 points) What is the average runtime of the insertion and deletion algorithms in a binary search tree and why? 21. (4 points) What is the worst case runtime of the insertion and deletion algorithms in a binary search tree and why? 7 Analysis 19. (4 points) How would a Huffman Tree look if all the frequencies of the symbols were equal? 20. (4 points) What is the average runtime of the insertion and deletion algorithms in a binary search tree and why? 21. (4 points) What is the worst case runtime of the insertion and deletion algorithms in a binary search tree and why