Fibonacci Numbers using an array

The goal for this exercise is to make sure that you can create and use an integer array to solve an interesting (i.e., non-contrived) problem

What you need to do to prepare for this exercise:

Watch any and all videos provided by your instructor about this topic
Re-read any section(s) that are beneficial to you - this exercise draws on your previously acquired knowledge.

What you need to do for this exercise

In the starter project, add code to the Fibonnaci_With_Array class, so that the RunExercise method does the following:
1. Create an array of, say, 20 elements
2. Manually set the first two entries of the array to be 0 and 1
3. Write a loop which will fill the remainder of the array entries with Fibonacci numbers, where
  
  Fibonacci(0) = 0
  
  Fibonacci(1) = 1
  Fibonacci(n) = Fibonacci(n – 1) + Fibonacci(n – 2)
  
  You should set things up so that Fibonacci(0) is stored in slot 0 of your array, Fibonacci(1) is stored in slot 1, etc.
4. Print out all the numbers in the array.
  
  Please note that because of the array, you do NOT need to solve this problem recursively. In fact, for this exercise, make sure that you don't solve it recursively – use a loop, instead. If you go looking for help online, you will almost certainly find many, recursive examples.