)in the adt graph, the method getnumberofedges has efficiency
a. o(1)
b. o(n)
c. o(logn)
d. o(n2)

B.O(n)

Explanation:

In ADT graph the efficiency of the method getNumberOfEdges is O(n) because to get the number of edges we have to traverse the whole graph or every vertex if there are n vertices so the time complexity of traversing the graph comes out to be O(n).

Hence we conclude that the answer to this question is O(n).