The Collatz Conjecture or 3x+1 problem can be summarized as follows:
Take any positive integer n. 
If n is even, divide n by 2 to get n / 2. 
If n is odd, multiply n by 3 and add 1 to get 3n + 1. 
Repeat the process indefinitely. 
The conjecture states that no matter which number you start with, you will always reach 1 eventually.
Given a number n, return the number of steps required to reach 1.
<h2>Examples</h2>
Starting with n = 12, the steps would be as follows:
<ol start="0">
<li>12</li>
<li>6</li>
<li>3</li>
<li>10</li>
<li>5</li>
<li>16</li>
<li>8</li>
<li>4</li>
<li>2</li>
<li>1</li>
</ol>
Resulting in 9 steps. 
So for input n = 12, the return value would be 9.