Write a Haskell function log2 that takes a parameter n
and returns the number of times you can divide n by 2 before
reaching 1. For example, log2 25 should return 4, since
it takes 4 divisions of 100 until we reach 1:
12 div 2 = 6
6 div 2 = 3
3 div 2 = 1