1.1 (15 pts) The diagram shows the parent-child relationships among six processes. (The parent links have been omitted for clarity.) 6 7 1 1 8 0 3 Complete the table by showing which field points to which process using the four different pointers. If an entry is unknown, enter - 6 7. 1 8 0 3 p 6 6 7 - ys - 1 - 0 3 OS - 7 1 1.2 (6pts) Similarly, given the relationships between the parent and child processes (shown below), consider the situations when Process O is deleted. |1| 4 2 5 3 Now, complete the resulting table. Solution: 1 4 4. 6 2. 5 3 - 1 1 1 1 4. 4 4 4 2 - ys 6 - OS 4 1.1 (15 pts) The diagram shows the parent-child relationships among six processes. (The parent links have been omitted for clarity.) 6 7 1 1 8 0 3 Complete the table by showing which field points to which process using the four different pointers. If an entry is unknown, enter - 6 7. 1 8 0 3 p 6 6 7 - ys - 1 - 0 3 OS - 7 1 1.2 (6pts) Similarly, given the relationships between the parent and child processes (shown below), consider the situations when Process O is deleted. |1| 4 2 5 3 Now, complete the resulting table. Solution: 1 4 4. 6 2. 5 3 - 1 1 1 1 4. 4 4 4 2 - ys 6 - OS 4