Answer
P(n) is true for all integers n.
Work Step by Step
Let P(n) be “F(n) is well-defined.” Then P(0) is true because F(0) is specified.
--Assume that P(k) is true for all k < n.
- Then F(n) is well-defined at n because F(n) is given in terms of
F(0), F(1), . . . , F(n − 1).
-So P(n) is true for all integers n.
