dear readers I have done my researches and still un-able to solve this program so please I need someone to help me or even solve it but as I think we must use semaphores, forks and pipes that's what I think but not understanding how to start am not good in C language... thanks for all.

We are requested to implement a code cracking system. The system will deploy four processes (p1,p2,p3 & p4) to try to guess the password of an encrypted code.

For encryption, we consider that the formula is: C = P XOR K, where

• C = encrypted code

• P = plain text

• K = key

For decryption the formula is: P = C XOR K. So, your program will try to find K using this formula. The XOR operator is ^.

Given an encrypted code C and plain code P your program should deploy three processes to try and find the key used to encrypt the plain code. These three processes will be under the control of process P1.

All processes will send their results to process P1 and process P1 will terminate the three processes and display the encryption key and decrypted text once any of the three processes finds the key.

For simplicity we will consider that we have the original number P stored in a file called plain.txt and the encrypted code is stored in a file called cipher.txt. Consider that only numbers are stored in these files and they have a range between 0 and 100000000.

So we have P and C your program should find the key K. Consider that K is a positive number between 0 and 1000000.