Write a recursive method that returns the number in the 'pos' position in a sequence of numbers. The sequence is generated using pos1 and pos2 as the first and second numbers in the sequence. To get the next number in the sequence, you always add the two previous numbers. For example, if pos1=1 and pos2=1, the sequence is the Fibonacci numbers: 1,1,2,3,5,8,13, etc. So moveItDown(1,1,7) returns 13 because that is the number in position 7 of that sequence.