Multiple choice question for engineering Set 1 1. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________ a) O(E) b) O(V*V) c) O(E+V) d) O(V) AnswerAnswer: c [Reason:] In an adjacency list for every vertex there is a linked list which have the…