Exercise 3 - Red-black trees (40 pts) Read about red-black trees and answer the following questions. a) What are the basic operations supported by this data structure? b) What is the running time of inserting an element in a red-black tree? c) Briefly explain how an insertion is performed in such a data structure. d) Show the steps of inserting the following keys into an initially empty red-black tree: 5, 3, 6, 9, 14, 7,4 Note: you may build your tree by showing the elements of the red-black tree at different levels (using 2 different colors). For example, the steps to insert the elements 12, 19, 62 are: 12 12 19 19 12 62