Question $8$

Suppose there is a robot that builds a copy of itself in $2$ hours. The copy then starts to build

copies of itself as well. Let $r_n$ be the total number of fully functional robots after $n$ hours.

Suppose $r_0=1.$

Recursive Case, $r_n=$

$r_n=r_{(n-2)}+2$

$r_n=r_{(n-2)}**2$

$r_n=r_{(n-1)}+1$

None.