1. Analyze the asymptotic complexity of the one-variable-at-a-time method of computing dataflow information.
2. Analyze the worst-case asymptotic complexity of making an interference graph, for a program of size N (with at most N variables and at most N control-flow nodes). Assume the dataflow analysis is already done and that use, def, and live-out information for each node can be queried in constant time. What representation of graph adjacency matrices should be used for efficiency?