![3. Youre climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Input : 3 Return . 3 Steps [11 1], [1 2], [2 1] This picture describes n3 above, with a solution of 3. Provide a dynamic programming solution in pseudocode. No written explanation, but rather using functions, code notation, as explained throughout the semester.](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fec7%2Fec79d4c9-6f03-42e7-9c4a-40336f53a7bc%2FphpIfnQcT.png)
3. You’re climbing a stair case. It takes n steps to reach to the top. Each time
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured
![3. Youre climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Input : 3 Return . 3 Steps [11 1], [1 2], [2 1] This picture describes n3 above, with a solution of 3. Provide a dynamic programming solution in pseudocode. No written explanation, but rather using functions, code notation, as explained throughout the semester.](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fec7%2Fec79d4c9-6f03-42e7-9c4a-40336f53a7bc%2FphpIfnQcT.png)
3. You’re climbing a stair case. It takes n steps to reach to the top. Each time
PayPal Gateway not configured
PayPal Gateway not configured