Define the New Fibonacci sequence (denoted NF) to have the same recursive definition for n greater or equal than 2 as the Fibonacci sequence, except where the base cases are now changed to NF0 equals 2 and NF1 equals 5. Find the value of NF3.
I am a programmer and I am trying to derive this, however I am not sure whether I am right or wrong with the answer I am getting which is 12, hence looking out to validate my answer with. Thank you in advance