Optimised solution for isPrime kata.
Write a recursive function collatz(n) that calculates how many steps it takes to get 1 if you start from n and recurse as indicated in the code.
Task from Recursion and Stack (javascript.info)
codewars kata
Original solution (slow) requires optimization.