$[11$:$13$ pm$,30/01/2024]$ Rushi: $3.$ There is a staircase of n steps $($n$>0),$ a person standing at the bottom wants to reach

$[11$:$19$ pm$,30/01/2024]$ Rushi: There is a staircase of n steps $($n$>0),$ a person standing at the bottom wants to reach the top. The person can climb either $1,2,$ or $3$ stairs at a time. Count the number of distinct ways, the person can reach the top,

You need to write a function using recursion and a test program, that will produce the answer for any number of steps given by the use