Problem 002: Added SimpleSolution.hs which provides a faster, but not the optimal, solution to problem 002. The solution utilizes matrices to calculate the nth fibonacci number in O(logn) time.
Merge branch 'master' of https://github.com/cjmcgraw/ProjectEuler_Solutions