Write a function in $C$ language named PrimeChecker that takes an integer $n$ as its parameter and returns $1$ to the main function if it is a prime number and $0$ otherwise. The prototype of the function should be

int PrimeChecker $(intn)$;

$($a$)$ Now write the main function takes an integer $n$ as input and prints the Fibonacci series consisting of prime numbers upto nth term, using the function PrimeChecker.

Sample input$/$output

$\backslash$table$[[$Input$,$Output$],[320510,150],[150240,020]]$

$($b$)$ Write another main function that uses PrimeChecker to print the prime factors of an input integer $n.$

Sample input$/$output

$\backslash$table$[[$Input$,$Output$],[8,2],[24,23]]$