QUESTION 3 A graph G(V, E) is a relation between V (the set of vertices) and E (the set of edges). Therefore, G can be implemented as a dictionary object in Python. False True QUESTION 4 A main reason for using adjacency list rather than matrix to represent a graph GIV, E) is for time efficiency. True False QUESTION 5 Given the same starting and ending nodes on a graph G, one always get the same path with DFS. True False QUESTION 6 Let G be a graph with n nodes and m edges. Then, the asymptotic time complexity for DFS is O(n + m). True False QUESTION 7 Let G be a graph with n nodes and m edges. If there is a constant c>o such that m