How would you solve this question in Python?

How would you solve in Python?

Part I: Rolling Logs (20 points) Write a function another-one () that takes the following arguments, in this order: 1. integer: a positive integer 2. divisor: any integer, including zero CSE 101 - Fall 2017 Lab #4 Page 1 Your function should return the number of times the given integer can be divided by the divisor until the quotient is less than 1. That is, divide integer by divisor, add one to a count, and replace integer with the quotient. For instance, suppose integer is 13 and divisor is 2. The following set of divisions will be performed: 132-6 62-3 32=1 12-0. In the case, the function would return 4. If divisor equals 0, the function simply returns 0. Examples: Function Call another.one (123, 2)7 another.one (512, 3) 6 another.one (132, 5)4 Return Value