Question: The Collatz conjecture concerns what happens when we take any positive integer n and apply the subsequent algorithm:
n= n/2, if n is even
3 × n + 1, if n is odd
The conjecture states that when this algorithm is continually applied, all positive integers will eventually reach 1.
For case, if n = 35, the sequence is 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1
Prepare a C program using the fork() system call that generates this sequence in the child process. The starting number will be provided from the command line.
For case, if 8 is passed as a parameter on the command line, the child process will output 8, 4, 2, 1. Because the parent and child processes have their own copies of the data, it will be required for the child to output the sequence. Have the parent invoke the wait() call to wait for the child process to complete before exiting the program.
Perform required error checking to ensure that a positive integer is passed on the command line.
You need to prepare a program to make a system call - Use the c programming language to prepare this program.