Question $48(2\mathrm{.}5$ points$)$

$1$ Saved

Primitive recursive functions exhibit the same computational power as

programming without loops nor recursion

while loops that never stop

while loops that stop at some point

for loops

while loops