a) Find a recurrence relation for the number of ways to climb n stairs if the person climbing the stairs can take one, two, or three stairs at a time.
b) What are the initial conditions?
c) In many ways can this person climb a flight of eight stairs?
A string that contains only 0s, 1s, and 2s is called a ternary string