a. Due to tendency of binary search trees becoming unbalanced, is not guaranteed to get a best time in most of operation performed on it. To solve this problem a self-balancing tree data structure red-black tree is introduced. With you knowledge in red-black trees: i. Perform an Insertion and deletion operation of any red-black tree of your choice. Using diagrams or mathematical notations critically explain the time complexity of these two operations (10 Marks) b. Using user-defined function, create a C++ or Java application implementing a linked list data structure. The application should be able to perform the following operations on the data structure can with the following operations. i. ii. iii. insertion into the list deletion from the list printing the content of the list 15 marks