15-451 MINI #3: due 11:59pm Oct 4 ================================= 1. Draw a treap containing the following (key priority) pairs: (a 5), (b 2), (c 3), (d 1), (e 7), (f 10), (g 5). Feel free to just do an ascii drawing. 2. Consider an initially-empty B-tree with t=3 (so a node has at most 5 elements in it) a. Suppose you insert A B C D E F G H I in order. What does the resulting B-tree look like? b. Suppose you insert I H G F E D C B A in order. What does the resulting B-tree look like? c. Did you get the same answer for a and b?