Insert the following n objects, in the order given, into a binary min-heap and place your answer into an array (15 p) 5, 3, 9, 7, 2, 4, 6, 1, 8

and

5. Answer the following questions regarding Red Black trees:

1. What are the operations that could be performed in O(log n) time complexity by red-black tree? (5 p)
2. Insert the following sequence in to a red black tree (show each step): 5, 6, 1, 9, 2, 4, 3, 8, 7 (15 p)