C++ please

Each process is represented by a data structure called the process control block (PCB). The PCBs are simplified as follows: - All PCBs are implemented as an array of size n,PCB[n]. - Each process is referred to by the PCB index, 0 through n1. - Each PCB is a structure consisting of only the two fields: - parent: a PCB index corresponding to the process's creator - children: a pointer to a linked list, where each list element contains the PCB index of one child process The necessary functions are simplified as follows: - create (p) represents the create function executed by process PCB[p]. The function creates a new child process PCB[q] of process PCB[p] by performing the following tasks: - allocate a free PCB[q] - record the parent's index, p, in PCB[q] - initialize the list of children of PCB[q] as empty - create a new link containing the child's index q and appends the link to the linked list of PCB[p] - destroy(p) represents the destroy function executed by process PCB[p]. The function recursively destroys all descendent processes (child, grandchild, etc.) of process PCB[p] by performing the following tasks: - for each element q on the linked list of children of PCB[p] - destroy(q) recursively destroy all progenies / - free PCB[q] - deallocate the element q from the linked list Assignment Assume that PCB[0] is the only currently existing process. Write a test program that performs a series of process creations and destructions. Ex: cr[0]/ creates 1st child of PCB[0] at PCB[1]/ cr[0]/ creates 2 nd child of PCB[0] at PCB[2]/ cr[2]/ creates 1st child of PCB[2] at PCB[3]/ cr[0]/ creates 3 rd child of PCB[0] at PCB[4]/ de[0] / destroys all descendents of PCB[0], which includes processes PCB[1] through PCB[4]/