The USES relation naturally forms a graph. As mentioned in the lecture, the USES relation graph should be a Directed Acyclic Graph (DAG). (1) A graph could be represented with two different data...

Please answer the (2) part of this question

Extracted text: The USES relation naturally forms a graph. As mentioned in the lecture, the USES relation graph should be a Directed Acyclic Graph (DAG). (1) A graph could be represented with two different data structures, i.e., adjacency list and adjacency matrix. Represent the USES relation graph in Figure 3-1 with adjacency list and adjacency matrix. 3 2 4 5 6. Figure 3-1: USES relation graph of the modules in a system (2) Suppose the input of a USES relation graph is represented with adjacency list, develop a function in pseudocode to check whether the USES relation graph is an acyclic graph, using Stepwise Refinement technique taught in lectures. You should provide with at least 2 refinements. Assuming there are V vertices and E edges, please state the time complexity of your algorithm.