3. In Python, a list comprehension is an expression of the form (f(x) for x in L if c(x)]. (The square brackets and the keywords "for, in, and f are all part of the expression; other variations are possible but not needed for this question.) It finds all of the values x in a list (or iterator) L, checks for each of them whether or not condition (2) is true, and makes a list of the values f(x) for which it is true. Suppose that G is a variable representing a graph, in the Python graph format, and that v is a vertex in G. Write a list comprehension that makes a list of the vertices u for which there exists an edge u + v, using the expressions for listing vertices in a graph and for testing adjacency of two vertices as given in the lecture notes. Using the assumption that (for a modified Python graph representation using sets instead of lists, which can be used in the same way) a single adjacency test takes time 0(1), what is the total time for computing the value of your expression? 3. In Python, a list comprehension is an expression of the form (f(x) for x in L if c(x)]. (The square brackets and the keywords "for, in, and f are all part of the expression; other variations are possible but not needed for this question.) It finds all of the values x in a list (or iterator) L, checks for each of them whether or not condition (2) is true, and makes a list of the values f(x) for which it is true. Suppose that G is a variable representing a graph, in the Python graph format, and that v is a vertex in G. Write a list comprehension that makes a list of the vertices u for which there exists an edge u + v, using the expressions for listing vertices in a graph and for testing adjacency of two vertices as given in the lecture notes. Using the assumption that (for a modified Python graph representation using sets instead of lists, which can be used in the same way) a single adjacency test takes time 0(1), what is the total time for computing the value of your expression