Very confused with this problem. Explanations with the code would help a lot

1. Sets of numbers can be represented using array of Os and 1s. The idea is that a [i]!-0 if i is in the set, and a [ 0 if it is not. For example, the array a [ 10] = { 0, 0, 1 , 0, 1, 1, 0, 0, 0, 0) would represent the set (2, 4, 5) because a [2], a[4], and a [5] have the value 1, and everywhere else a contains zeros. Since the array has a fixed bound, say N, the values in the set are restricted to the range 0...N-1 Write a C program that reads in two sets of numbers A and B, and calculates and print their difference of set A and B: A -B, complement of set A: A and complement of set B: B. A B is the set of elements that appear in A but not in B, and that A is the set of every element that is not in A. The values in the sets are restricted to the range 0... 9. 1) Name your program set operations.