2) [10 points] Write an iterative algorithm (using the same sort of C++- like pseudocode used in the text) for finding the nth term in the Abid Sequence which is much more efficient than the given algorithm in question 1. Do a worst-case analysis of your algorithm in which you count the number of additions and subtractions (but do not count additions or subtractions that are increments of a loop counter).

1) [11 points total] Consider the following variation of the Fibonacci numbers, called the Abid numbers, which are defined recursively as follows: Ao 0, Al-1, A2 _ 2, A3-3, A4 _ 4 and for n 5, An-An-1 +An-2 +An-5 + 2. So the Abid Sequence is 0, 1, 2, 3, 4,9, 16, 29, A recursive algorithm which finds the nth term in the Abid Sequence is the following: Problem: Determine the nth term in the Abid Sequence. Inputs: a nonnegative integer n. Outputs: abid, the nth term in the Abid Sequence. int abid (int n) if (n