There are n stairs. A person standing at the bottom wants to reach the top. They can climb either 1 stair or 2 stairs at a time. However, they cannot climb 2 stairs after they have climbed 2 stairs in the last climb, which means they cannot continuously climb 2 stairs. Let T(n) be the number of ways the person can reach the top. Please determine the recurrence T(n) and compute T(1), T(2) and T(3).

. May I have the steps to solve this problem, please? Thank you