Write a method that returns the highest Fibonacci number that is less than to the integer input parameter. Remember that Fibonacci numbers follow the pattern 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, etc. Notice that the first two Fibonacci numbers are both 1. To find any other Fibonacci numbers, just add the two previous numbers. For example, 13+21=34.