In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE?
- In both AST and CFG, let node $N_2$ be the successor of node $N_1$. In the input program, the code corresponding to $N_2$ is present after the code corresponding to $N_1$
- For any input program, neither AST nor CFG will contain a cycle
- The maximum number of successors of a node in an AST and a CFG depends on the input program
- Each node in AST and CFG corresponds to at most one statement in the input program