1. State the size of the input in big-Oh. For example, if the input to an algorithm is an array of size k, then the input size is O(k).

2. Derive the cost function for the algorithm. You can use O(1) to denote all constants.

3. State the complexity of the algorithm in Big-Oh. The complexity MUST be stated in terms of input-size.

input: F[n]//An array of integers output: index of integer that is not the sum of the preceding two integers for j=2n if F[i2]+F[i1]!=F[i] return i return 1