Q1 A tree is implemented as a BINARY tree by the node's child and sibling pointers.

Each node has a name string.

Assume: struct node *p points at a parent node A.

struct node *q points at a new node.

(1) Write C code to print the names of all children of A:

(2) Write C code to add q as a child of A:

Q2

What's a process? ______________________ What does ksleep() do?___________________ What does kwakeup() do?__________________ How does a process terminate? ___________ What does pid=wait(int *status) do?____________ Processes form a BINARY tree by child, sibling pointers. Assume: PROC *p kfork() a child *q. (1). Write code to insert q into CHILD list of p: _______________ (2). write code to print child list of p: ________________________