Draw the tree. Now insert same keys into a BST in a different order. Following should be order of insertion. Re draw the tree. 2. For previous Question, in which you draw two different trees, based on different order of insertions, discuss the trees generated. Discuss how shape of the tree effects the performance of search/insert operation. 1. Insert the following keys into BST in the given order. Draw the tree. Now insert same keys into a BST in a different order. Following should be order of insertion. Re draw the tree. J,PT:Q:D,GA,T:S:W: 2. For previous Question, in which you draw two different trees, based on different order of insertions, discuss the trees generated. Discuss how shape of the tree effects the performance of search/insert operation