Match all items in Group 1 with the best match from the options given in Group…

Solution Answer: Option 3 Min-and max-heaps: A min-max heap is a complete binary tree data structure that combines the usefulness of both a min-heap and a max-heap, that is, it provides constant-time retrieval and logarithmic time removal of both the minimum and maximum elements in it. This makes the min-max heap a very useful data structure to implement a double-ended priority queue. B-tree: B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as discs. It is commonly used in databases and file systems. Arrays: If an element in the array is inserted at the certain location then we have shift all the element after that particular location also after deletion we can only shift the element and set the last element to number which is not present in the array. Hence e insertion and deletion operations are expensive in the array. Graphs: Electronic network topology is related to mathematical topology for networks that contain only two-terminal devices, circuit topology can be viewed as an application of graph theory. Therefore option 3 is correct