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