The key of each node in a binary search tree is a short character string. 1. Show how such a tree would look after the following words were inserted (in the order indicated): monkey canary donkey deer zebra yak walrus vulture penguin quail 2. Show how the tree would look if the same words were inserted in this order: quail walrus donkey deer monkey vulture yak penguin zebra canary 3. Show how the tree would look if the same words were inserted in this order: zebra yak walrus vulture quail penguin monkey donkey deer canary