Answer:
In ADT graph the efficiency of addVertex has efficiency O(logn).
Explanation:
The time complexity of the method addvertex in ADT graph is O(logn). addVertex method has time complexity of O(logn) because it has to divide the list in half and add the vertex according to the place where the needs to be added.
hence we conclude that the answer is O(logn).
The correct answer for this question would be letter choice C) GUI or the third option.
Resource pools <span>are aggregated collections of memory and cpu resources that can be shared among groups of virtual machines or other entities.</span>