Question 7 2 pts The busy waiting solution using the turn variable in Peterson two-process algorithm works when the two processes are running on a shared-memory multiprocessor, that is, two CPUs sharing a common memory. True False Question 8 2 pts Peterson's two process algorithm guarantees mutual exclusion and progress. True O False Question 9 2 pts The concept of thread synchronization is required in multithreaded systems because threads of a single process share the process's process control block (PCB). True O False Question 10 2 pts In a pure User-Level Thread, all of the work of thread management is done by the application, but the kernel is aware of the existence of threads. True False Question 11 2 pts The primary advantage of the basic microkernel design over layered kernel designs involves increased performance. True False Question 12 2 pts It takes far less time to create a new thread in an existing process than to create a new process. True False Question 13 2 pts Cache memory is faster than main memory and machine registers. O True False Question 14 2 pts In Unix operating systems a forked child process is always aware that it is a child process born to a parent process. True O False