$($THIS WAS THE ABOVE SEQUENCE$)$

I apologize for not including it before submitting this question

$(20$ points$)$ Assume the following sequence of functions is issued $($each function is executed by the currently running process$).$ The create function always uses the next available PCB $1,2,3,...$:

create$(2)$

timeout$()$

create$(1)$

create$(2)$

timeout$()$

create$(0)$

Determine how many child processes each process has at the end of the above sequence.

PCB $0$: $3$ children $($PCB $1,$ PCB $2,$ PCB $3).$

PCB $1$: No children.

PCB $2$: No children.

PCB $3$: No children.

PCB $4$: No children.