Write a program to check number is prime or not using recursion.

#include
#include

int prime(int num,int count)
{
if(count{
if(num%count==0)
{
printf("%d is not Prime Number\n",num);
goto exit;
}
count += 1;
if(count {
prime(num,count);
}
}
if(num==count)
{
printf("%d is a Prime Number\n",num);
}
exit:
return 0;
}

int main()
{
int no;
printf("Enter the number = ");
scanf("%d",&no);
prime(no,2);


}