19. (24 points) Consider the C program below (on the next page)

Assume that all fork() calls complete successfully.

Answer the following questions: - (3 points) How many processes are created during the execution of this program (including the parent process)?

- (3 points) Draw the process hierarchy tree for this program.

- (3 points) How many times the First Print Statement is executed in this program?

- (3 points) For every process you showed in the process hierarchy tree, indicate the number of times it executes the First Print Statement

- (3 points) What are the minimum and maximum values of the count value printed by the execution of the First Print Statement?

MIN = MAX =

- (3 points) How many times the Second Print Statement is executed in this program?

- (3 points) For every process you showed in the process hierarchy tree, indicate the number of times it executes the Second Print Statement

- (3 points) What are the minimum and maximum values of the count value printed by the execution of the Second Print Statement?

MIN = MAX =

CODE FOR QUESTION 19:

#include #include #include int count = 0; int main(void) { int i; for (i=0; i<2; i++) { fork(); count++; printf("First:%d ", count); //First Print Statement } printf("Second:%d ", count); //Second Print Statement return 0; }