Question: The Fibonacci sequence is a series of whole numbers starting at 1, followed by the sum of the two preceding numbers. The first eight ones are 1, 1, 2, 3, 5, 8, 13 and 21.
Prepare *one* C program that will accomplish *all* the subsequent steps:
Part 1: Display the complete Fibonacci sequence until you reach a value less or equal than 1,000,000 (one million).
Part 2: Display the count of how many numbers are in that sequence between 1 and 1,000,000.
Part 3: Display (or emphasize in the display of step #1) all the numbers (if any) that are part of the Fibonacci sequence below 1,000,000 and whose square root is a whole number.
For case 16 has a whole square root (4), but 16 is not part of the Fibonacci sequence.
Part 4: Display (count) how many numbers satisfy the two conditions indicated in step #3 (part of Fibonacci below 1,000,000 and whole square root).
Part 5: Starting with the second number of the sequence, display the division of the number by the previous one for the complete sequence.
Can you see a pattern developing? We call this the Golden Number.
Please keep it simple and short and no copy and paste or at least help me get started - You have to satisfy the requirements specific in the instruction.