Java programming questions.

1. Given the previous Java implementation of an adjacency list representation of a directed graph, what is the runtime complexity of computing the out-degree of every vertex?

a. O(V)

b. O(V*E)

c. O(V + E)

d. O(V2)

2. Given the previous Java implementation of an adjacency list representation of a directed graph, what is the runtime complexity of computing the in-degree of every vertex?

a. O(V)

b. O(V + E)

c. O(V*E)

d. O(V2)

3. Given the previous Java implementation of an adjacency matrix representation of a directed graph, what is the runtime complexity of counting the number of edges of the graph?

a. O(V2)

b. O(V + E)

c. O(V*E)

d. O(V)

4. A vertex u of a directed graph can end up in a depth-first tree containing only u, even though u has both outward and inward edges.

a. True

b. False