Write a method that returns the number of "steps" needed to get to 1 from the positive input parameter 'num'. At each stage, each "step" proceeds in a particular order: First, if 'num' is even, divide num by 2. Second, if 'num' is a multiple of three, divide num by 3. Finally, if neither of these applies, subtract one from num. Each of these steps leads to a new value of num, and the steps continue until you reach a value of 1. Return the number of steps needed. For example: if 'num'=17, 5 steps are required. 17 is neither even nor a multiple of 3, so subtract 1 to get 16 (that is the first step). 16 is even so divide by 2 to get 8 (that is the second step). 8 is even so divide by 2 to get 4 (that is the third step). 4 is even, so divide by 2 to get 2 (that is the fourth step). 2 is even, so divide by 2 to get 1 (that is the fifth and final step). Look at the test data for additional examples.