Return how many times a positive integer can be divided by two before reaching 1
<p>Using basic python methods, create a function that takes a positive integer and answers the question: How many times can n be halved before reaching 1?</p>

<p>I m not sure how to even begin this one. I know I need a count function, but I am not sure how I would use that function. And would I use n//2 &lt; 1 or n%2 == 1</p>

<p>All help would be greatly appreciated.</p>
