Suppose you are working for a company, and you are that support one or more of the following functions asked to select dynamic data structures a) Insert(D, x): Inserts the key r into the data structure D, if it is not already in D, updating the data structure accordingly b) Search(D, x): Searches for the key r in D, returning true if the key is present in D and false otherwise (c) Delete-Min(D): Finds and deletes the smallest key in D, updating the data structure accordingly 1. For each of the above functions, state a data structure that can support the correspond ing operation, and runs in O(log n) time in the worst case, where n is the number of elements in the data structure 2. State a data structure that can support all of the above operations, and each operation runs in O(log n) time in the worst case, where n is the number of elements in the data structure