Consider the sequences (rn) and (sn) defined recursively by r0 = 1, s0 = 0, and rn+1 = rn/2, sn+1 = sn + rn+1 for n ≥ 0 a) What are the formulas for the nth terms rn and sn of these sequences? b) What...

 Consider the sequences (rn) and (sn) defined recursively by

r0 = 1, s0 = 0, and rn+1 = rn/2, sn+1 = sn + rn+1 for n ≥ 0

a) What are the formulas for the nth terms rn and sn of these sequences?

b) What is the floating point binary representation of sn?

c) Write a program on octave which generates the sequences (rn) and (sn) recursively.