A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elements in the set. o Delection of the smallest element o Insertion of an element if it is not already present in the setWhich of the following data structures can be used for this purpose?(A) A heap can be used but not a balanced binary search tree(B) A balanced binary search tree can be used but not a heap(C) Both balanced binary search tree and heap can be used(D) Neither balanced binary search tree nor heap can be used