Answer
-Recursive or the iterative algorithm for finding the sequence given
Work Step by Step
--procedure iterative(n: nonnegative integer)
-if n = 0 then z := 1
-else
if n = 1 then z := 2
else
-x := 1
-y := 2
-z := 3
-for i := 1 to n − 2
-w := x + y + z
-x := y
-y := z
-z := w
-return z {z is the nth term of the sequence}
