Implement a modified Fibonacci sequence using the following definition:

Given terms and where , term is computed as:

Given three integers, , , and , compute and print the term of a modified Fibonacci sequence.

Example

Return .

Function Description

Complete the fibonacciModified function in the editor below. It must return the number in the sequence.

fibonacciModified has the following parameter(s):

• int t1: an integer
• int t2: an integer
• int n: the iteration to report

Returns

• int: the number in the sequence

Note: The value of may far exceed the range of a -bit integer. Many submission languages have libraries that can handle such large results but, for those that don't (e.g., C++), you will need to compensate for the size of the result.