This exercise involves printing out the generations of a series of processes created using fork(). You will create a program that accepts a single command line argument indicating the number of generations that should be created. For each generation, your program will fork a child process until you have created a series of children of the right length. Each process should print its own generation, in reverse order. When the generations are printed, each process should print its own process ID, as well as the process ID of its parent process. Example Output Here are some sample runs: No argument If no argument is provided, the program should print a message and exit $ ./generations Usage: ./generations num_generations Invalid argument If the argument is less than 0, the program should print a message and exit $ ./generations -1 Error: num_generations must be greater than 0 2$ Correct Argument $ ./generations 5 Great Great Great Grandchild. pid: 5732 ppid: 5731 Great Great Grandchild. pid: 5731 ppid: 5730 Great Grandchild. pid: 5730 ppid: 5729 Grandchild. pid: 5729 ppid: 5728 Child. pid: 5728 ppid: 5727 Parent. pid: 5727 ppid: 3329
please help me answer this question I will give you a good rating Thank you!
In c++ please
1 #include <sys/types.h>
2 #include <sys/wait.h>
3 #include <unistd.h>
4 #include <stdlib.h>
5
6 #include <iostream>
7
8 using namespace std;
9
10
11 // Given a number, this function should print the associated generation
12 // of the child. along with the child's process ID and the parent's process ID.
13 //
14 // Generations should be:
15 // 0 - Parent
16 // 1 - Child
17 // 2 - Grandchild
18 // 3 - Great Grandchild
19 // 4 - Great Great Grandchild
20 // etc.
21 //
22 // Examples:
23 //
24 // printGeneration(1): Child. pid: <pid>: ppid: <ppid>
25 // printGeneration(3): Great Grandchild. pid: <pid> ppid: <ppid>
26 //
27 void printGeneration(int generation)
28 {
29 // TODO: Add Implementation of printGeneration here
30 }
31
32
33 int main(int argc, char ** argv)
34 {
35 // TODO: The program should take a single numeric command line argument, which
36 // indicates how many generations to process.
37 //
38 // Retrieve this argument from the command line here.
39 // If there is no command line argument, or if the argument is less than 0,
40 // print an error and exit with a non-zero exit code.
41
42
43
44
45 // TODO: Implement the main logic of your program here.
46 // The program should use fork() to create a new child process
47 // for each generation, up to the number of generations indicated
48 // by the command line argument.
49 //
50 // Each process (including the parent) should print their generation
51 // using the printGeneration() function above *in reverse order*
52 // (so the last generation prints first).
53 //
54 // Example output:
55 // $ ./generations 5
56 // Great Great Great Grandchild. pid: 4569 ppid: 4568
57 // Great Great Grandchild. pid: 4568 ppid: 4567
58 // Great Grandchild. pid: 4567 ppid: 4566
59 // Grandchild. pid: 4566 ppid: 4565
60 // Child. pid: 4565 ppid: 4564
61 // Parent. pid: 4564 ppid: 3329
62
63 }
![This exercise involves printing out the generations of a series of processes created using
fork().
You will create a program that accepts a single command line argument indicating the number
of generations that should be created. For each generation, your program will fork a child
process until you have created a series of children of the right length. Each process should
print its own generation, in reverse order.
When the generations are printed, each process should print its own process ID, as well as
the process ID of its parent process.
Example Output
Here are some sample runs:
No argument
If no argument is provided, the program should print a message and exit
$ . /generations
Usage: ./generations num_generations
Invalid argument
If the argument is less than 0, the program should print a message and exit
$ ./generations -1
Error: num_generations must be greater than 0
2$
Correct Argument
$ ./generations 5
Great Great Great Grandchild. pid: 5732 ppid: 5731
Great Great Grandchild. pid: 5731 ppid: 5730
Great Grandchild. pid: 5730 ppid: 5729
Grandchild. pid: 5729 ppid: 5728
Child. pid: 5728 ppid: 5727
Parent. pid: 5727 ppid: 3329](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3935a5a6-1355-4442-a788-b5eb7b8f90d8%2F6534fe1d-932a-4552-bc4f-30c5b3d25a84%2Fqnhpb4g_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
According to the information given:-
We have to generate series of processes created using fork().
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)