l. A BST generated from "random input will have O(log n) execution time for each insert operation, and therefore the cost of building the entire tree will be O(n log n). However, many common input sequences will generate highly unbalanced trees, which will severely affect build times With each of the following sequences for the integers 0 to 99, sketch the general shape of the resulting BST 0 1 2 3 4 . 99 99 98 970 0 99 1 98 2 97... 50 49 51 48 52... // ascending // descending // outside-in // inside-out 2. Draw the result of rotating the root of each of these trees to the right. Repeat for rotating to the left. 2 4