$(1\%$ Below is the test$\_$fork.c file which creates $3$ different types of topologies of the processes

$($linear$,$ Binary tree and star topology$).$ Save the code in a file and name it test$\_$fork$\_$toplogies.c$,$

compile and run it$.$ Note down the output for each topology and create graphs for each. For

example, for star topology, the graph will look something like this:

For the graphs, use the output trom the command window and understand the flow to create the

graphs. Write down your description of the flow generated from each topology. Do not exceed For the graphs, use the output from the command window and understand the flow to create the

graphs. Write down your description of the flow generated from each topology. Do not exceed

the length to more than $1$ page. You will need to pay close attention to the exit and wait

commands in the code to understand the flow:

#include child$\_$pid $=$ getpid$()$;

parent$\_$pid $=$ getppid$()$;

printf$("2.$ Child Process $($ID$)$: $\%$d$,$ parent process $($ID$)$: $\%$dln$",$ child$\_$pid, parent$\_$pid$)$;

$\}$

exit$(0)$;

$\}$

wait$($NULL$)$;

$\}$

printf$("$InStar topology of processes: $ln$

for $($int $i=0$;$i<mn>6</mn>$;$i++)$

if $($fork$()==0)\{$

child$\_$pid $=$ getpid$()$;

parent$\_$pid $=$ getppid$()$;

print$("$Child Process $($ID$)$: $\%$d$,$ parent process $($ID$)$: $\%$dln$",$ child$\_$pid, parent$\_$pid$)$;

exit$(0)$;

$\}$

$\}$

for $($int $i=0$;$i<mn>5</mn>$; $i++)$

wait$($NULL$)$;

$\}$

return $0$;