Suppose there is a robot that can build a copy of itself in 2 hours.
the copy then starts to build copies of itself as well.
let rn be the total number of fully functional robots after n hours.
(a) (2 points) suppose r0 = 1, nd the following:
r1 =_ r2 =_ r3 =_ r4 =_ r5 =_ r6 =_
(b) (3 points) give a recursive definition of rn.
you may write this as a mathematical definition