CL05 Grade 5 p You are given a staircase with steps to go from the bottom to the top using these Suppose you can take one step or two at a time as your movement. Write a recunive called num_ways that takes the positive integer N and returns the number of ways go from bottom to the top. Don't forget to call the method in the main() and show the Example: 0 IN=2, you have 2 ways as shown in the picture. One way using the one step in the solid arrows; so, the path is [0, 1, 2). The second way is using the movement as shown in the dashed arrow; so, the second path is [0, 21- Therefore, bum_ways(2) returns 2 IN-1, we have one path which is [0, 1]. If N=0, we can assume that it has one path also [0]. Sample output: num_ways(4) >> ways to climb a staircase of 4 steps - 5