Answer is option $A$
$\text{A. Recursive programs are more powerful than iterative programs}$.
This is $\text{false }$as there exist an iterative program for every recursive program.
Primitive recursive functions correspond to programs using bounded iteration, that is, you have to specify the number of iterations that a loop is executed in advance. Bounded iteration cannot simulate recursion in general, since the Ackermann function isn't primitive recursive. But unbounded iteration can simulate any partially computable function.
$\text{B. For every iterative program there is an equivalent recursive program.}$ True
$\text{C. Recursive programs require dynamic memory management.}$
True, as number of calls is not known advance for recursive functions.
$\text{D. Recursive programs do not terminate sometimes.}$ True
$\text{E. Iterative programs and recursive programs are equally expressive.}$
True. Here is an "iterative" algorithm for the Ackermann function
