Please very early..I have 1 hour.. please

2. True or False ( 10,1 per blank) 1. The CPU can access the main memory and the registers. ( ) 2. Both SJF and priority scheduling algorithms may lead to starvation problem. ( ) 3. The operation system can use the thread as a basic unit to allocate resources. ( ) 4. When the time slice of a process expires, the process will switch from running state to the waiting state. ( ) 5. Using microkernel approach to develop an operating system will remove all nonessential components from the kernel and implementing them as system and user-level programs. (r) 6. Race condition can be used to solve the critical section problem. ( ) 7. Peterson algorithm cannot satisfy the bounded waiting condition. 8. Inadequate use of semaphores may cause deadlock problem. ( ) ) 9. Time sharing system usually has no long-term scheduling. ( 10. In three thread models, the many to one model works under the kernel mode