This problem is solved in ANSI C.

Problem 4 (5 points Write a program that asks the user for a positive integer, say n, creates a Fibonacci sequence up to n, and counts all numbers in this sequence that are divisible by 2, 3, 5, 6, 10, and 15, and the numbers that are not divisible by any of the above numbers. Output the result in a table, e.g Enter a positive integer 2000 Fibonacci sequence up to 2000 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, divisibley by: 10 15 Store your program in file countfib.d