Let =(,) be a directed graph that is given in adjacency list format: For every vertex , we are given a list containing all vertices such that (,) is an edge. How much time is needed to compute, for every vertex , the list of all vertices such that (,) is an edge? Select one: a. (||log||) b. (||||) c. (||+||) d. ((||+||)log||).