4) Due to the simplistic mechanism used within the kernel to track pending signals for a given process, it is possible that . . . (a) a process terminates without becoming a zombie process (b) a parent process does not receive a SIGCHLD signal for every terminated child process (c) a child process cannot be reaped by the parent with the wait system call (d) a parent process is notified of a child’s termination before it has actually occurred

5) In response to a valid open system call for a file that is already open, the kernel ... (a) allocates a new open file description object (b) allocates a new v-node object (c) allocates a buffer for the purposes of I/O redirection (d) copies an existing file allocation table entry to a new table index

6) The following C structure and type definitions are used in this problem to construct a linked list: struct node { int val; struct node *next; }; typedef struct node llnode; typedef struct node *llnodep; After reading the comment that precedes each of the following functions, circle the letter corresponding to the code fragment that completes the implementation correctly. The following C structure and type definitions are used in this problem to construct a linked list: struct node { int val; struct node *next; }; typedef struct node llnode; typedef struct node *llnodep; After reading the comment that precedes each of the following functions, circle the letter corresponding to the code fragment that completes the implementation correctly. /* Allocates space for a new node and initializes it * to the given values */ llnodep make_node (int val, llnodep next) { llnodep p = __________________________; p->val = val; p->next = next; return p; } A. malloc(sizeof(llnode)) B. malloc(sizeof(llnodep)) C. malloc(sizeof(int) + sizeof(llnode))