Please use the C Programming Language, not C++.

![Implementation Details:
We will usearraystorepresent sets,
Void checkSet(int input[], int input_length) \{
//print set cannot](https://media.cheggcdn.com/media/dfe/dfef39ef-be79-4512-8c5a-15887b65c200/phpiUABUj)

Write a program to compute the Jaccard similarity between two sets. The Jaccard similarity of sets \( A \) and \( B \) is the ratio of the size of their intersection to the size of their union Example: Let say, \[ \begin{array}{l} A=\{1,2,5,6\} \\ B=\{2,4,5,8\} \end{array} \] then \( A \cap B=\{2,5\} \) and \( A \cup B=\{1,2,4,5,6,8\} \) then \( |A \cap B| /|A \cup B|=2 / 6 \), so the Jaccard similarity is \( 0.333 \).
Implementation Details: We will usearraystorepresent sets, Void checkSet(int input[], int input_length) \{ //print set cannot be empty if empty array 3 int findlntersection(int input1[], int input1_length, int input2[], int input2_length)\{ //return number of similar elements in two set 3 int findUnion(int input1], int input1_length , int input2[], int input2_length)\{ //return total number of distinct elements in both sets 3 void calculateJaccard(int input1[], int input1_length, int input2[], int input2_length)) \{ // call other functions and print the ratio \}
Input: Input first set length: 0 Input first set: Output: set cannot be empty .