incomplete solution in 2-starting-out for rotate

[scottnm]

rotate's solution is rotate n l = drop n l ++ take n l

this doesn't take into account rotations larger than the length of the list.

occurrences of n should be n mod (length list)