4. Bonus Task: Remember the implementations of SortedList data structures? So far, we have implemented array based and linked list based SortedList data structure. Your job for this task is to implement a binary search tree based SortedList data structure. In the driver file: a. Create an integer Sorted List object. b. Insert some items. c. Print the list. All of the function prototypes for your SortedList class functions must be the same as they are for the linked list based SortedList class. Need hints? Check the class recording of the last class. 4. Bonus Task: Remember the implementations of SortedList data structures? So far, we have implemented array based and linked list based SortedList data structure. Your job for this task is to implement a binary search tree based SortedList data structure. In the driver file: a. Create an integer Sorted List object. b. Insert some items. c. Print the list. All of the function prototypes for your SortedList class functions must be the same as they are for the linked list based SortedList class. Need hints? Check the class recording of the last class