I need help for this C language program assignment. Please help me with the codes. Thank you

Lab 03: Resolve the Connectivity Problem Note: Students must demonstrate their lab in the following week of October 19'\Figure: The objects in a connectivity problem might represent connection points. and the pairs might be connections between them, as indicated in this idealized example that might represent wires connecting buildings in a city or components on a computer chip. This graphical representation makes it possible for a human to spot nodes that are not connected, but the algorithm must work with only the pairs of integers that it is given. Are the two nodes marked with the large black dots connected? The goal is to write a program to filter out extraneous pairs from the set: When the user inputs a pair p C], it should output the pair only it the pairs it has seen to that point do not imply that p is connected to q. If the previous pairs do imply that p is connected to q, then the program should ignore pq and should proceed to input the next pair. Write a quick-find solution to the connectivity problem. Your program should read a sequence of pairs of nonnegative integers less than N from standard input (interpreting the pair p q to mean \"connect obj ect p to object q\") and prints out pairs representing objects that are not yet connected. The program maintains an array id of size N that has an entry for each obj eat, with the property that id [p] and id[q] are equal if and only if p and q are connected. The basis of the algorithm is an array of integers with the property that p and q are connected if and only if the p"-h and c1th array entries are equal. We initialize the :i.ch array entry to i for 0 S i