C Programming - Arrays (Part 1/3)Hello, since this is a multipart question, as per the policy, I have specified these three parts. Thank you so much for helping me out! A set of integers may be implemented using an array of integers. Since the array is only partially filled,it is important to store the number of elements contained in the array. The program contains the arrayitself and another integer to store the actual number of elements in the set.To illustrate, given a set s= {3, 8, 15, 20}123456elements1520count4Implement the following functions given the definition:typedef int Set (MAX);//Set is just an alias for int [MAX)//Set means an array of integerSvoid initialise (int*count);simply set count to ovoid display (Set s, int count);-display on the screen all valid elements of the array, from 0.count-1-void add (Set s, int * count, int elem);simply store elem in the array indexed by count then increment countint contains (Set s, int count, int elem);search the array elements for the value elemvoid getUnion (Set result, int *count, Set 1, int countl,Set s2, intcount2);store in the array result the set resulting from the union of s1 and s2x is an element of s1 union s2 if x is an element of s1 or x is an element of s2void intersection (Set result, int *count, Set s1, int countl, Set s2, intcount2);store in the array result the set resulting from the intersection of s1 and s2x is an element of s1 intersection s2 if x is an element of s1 and x is an element of s2void difference (Set result, int *count, Set sl,int countl, Set s2, intcount2);store in the array result the set resulting from the difference of s1 and s2x is an element of s1 - s2 if x is an element of s1 and x is not an element of s2void symmetricdifference (Set result, int *count, Set sl,int countl, Set52, int count2);store in the array result the set resulting from the symmetric difference of s1 and s2x is an element of s1 - s2 if x is an element of s1 and x is not an element of s2 and vice versaint subset (Set sl, int countl, Set s2, int count2) ;si is a subset of s2 if all elements of s1 are in s2int disjoint (Set s1,int countl, Set s2, int count2);two sets are disjoint if the intersection is emptyint equal (Set sl, int countl, Set s2, int count2);two sets are equal if they have exactly the same elements-Project name: SetArrayFilenames: set.h, set.c, main.c00

Name: C Programming - Arrays (Part 1/3)Hello, since this is a multipart ques
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: C Programming - Arrays (Part 1/3)Hello, since this is a multipart question, as per the policy, I have specified these three parts. Thank you so much for helping me out! A set of integers may be implemented using an array of integers. Since the array

set.h #define Max 20typedef int Set[Max]; void initialize (int *count);void display (Set S, int…

Engineering

Computer Science

A set of integers may be implemented using an array of integers. Since the array is only partially filled, it is important to store the number of elements contained in the array. The program contains the array itself and another integer to store the actual number of elements in the set. To illustrate, given a set s= (3, 8, 15, 20} 0 1 2 3 4 5 elements 15 20 count Implement the following functions given the definition: //Set is just an alias for int (MAX) //Set means an array of integers typedef int Set (MAX) ; void initialise (int *count); simply set count to 0 void display (Set , int count); display on the screen all valid elements of the array, from 0.count-1 void add (Set s, int *count, int elem); simply store elem in the array indexed by count then increment count int contains (Set s, int count, int elem); search the array elements for the value elem void getUnion (Set result, int *count, Set sl, int countl, count2); - store in the array result the set resulting from the union of s1 and s2 Set 2, int xis an element of s1 union s2 if x is an element of s1 or x is an element of s2 void intersection (Set result, int *count, Set s1, int countl, Set s2, int count2); store in the array result the set resulting from the intersection of s1 and s2 xis an element of s1 intersection s2 if x is an element of s1 and x is an element of s2 void difference (Set result, int *count, Set s1,int countl, Set s2, int count2); - store in the array result the set resulting from the difference of s1 and s2 - xis an element of s1 - s2 if x is an element of s1 and x is not an element of s2 void symmetziedifference (Set result, int *count, Set s1, int countl, Set s2, int count2); store in the array result the set resulting from the symmetric difference of s1 and s2 x is an element of s1 - s2 if x is an element of s1 and x is not an element of s2 and vice versa int subset (Set sl, int countl, Set s2, int count2); - si is a subset of s2 if all elements of s1 are in s2 int disjoint (Set sl, int countl, Set 2, int count2); two sets are disjoint if the intersection is empty int equal (Set sl, int countl, Set s2, int count2); two sets are equal if they have exactly the same elements Project name: SetArray Filenames: set.h, set.c, main.c