Algorithm 3 Three programs that are supposed to compute Fn for a non-negative integer n 1: procedure FO(n) 3 while m >3 do 4: 5: 6: 8 if m 0 then 9: return i 10 else if m-1 then 12: 13: 14: return else return k 15: procedure F1(n) 17: while n >3 do 18: 19: 20: 21 22: if m 0 then 23: 24 else 25: 26: mm-2 k+i+j return i if m-1 then return else return k 29: procedure F2(n) 30: 31 if m