3. Let sn be the number of ways (order being important) of writing n as a sum of 1s and 2s. For example s4=5 because 4 can be written in five ways: 1+1+1+1,1+1+2,1+2+1,2+1+1,2+2 Find a recurrence for sn