A boy runs up a flight of stairs consisting of n steps; in 1 bound, he can move up one, two or three steps.
Implement the numberOfPossibleAscents(int n) method, which should return the number of ways the boy can
ascend an entire flight of stairs consisting of n steps.
You can't complete this task, because you're not signed in.