Computer Science: Operation system questions. Will give thumb up, thank you!

Select the best answer with respect to deadlock elimination. A) We can eliminate deadlock by terminating all the processes that are deadlocked B) We can eliminate deadlock by terminating one process at a time until a deadlock cycle is eliminated C We can eliminate deadlock by informing the operator that a deadlock has occurred and lets the operator deal with the deadlock manually D) We can eliminate deadlock by successively pre-empting some resources from processes and giving these resources to other processes until the deadlock cycle is broken. Select one or more: a. Only Options A, B and D are true b. Only options A and B are true c. Only option C is true d. Only options C and D are true e. All of them are true f. Only options B and D are true oose the correct answer based on the following statements regarding shared memory that is accessed by multiple threads 1) Shared memory can run into race conditions if it is not accessed in the correct order by the threads. 2) Since the shared memory is isolated between the threads, the main advantage of using shared memory is that it can never run into race conditions. 3) Shared memory has a serious disadvantage of leaving processes to starve since a single thread can hog the resource by never letting the other threads to access it. 4) Even though the memory is shared, there need not be any synchronization mechanisms for shared memory because the OS will take care of the thread management on its own 5) Shared memory provides an extremely fast way to communicate large or small amounts of data because any data, that is written by one thread to a shared memory region, can be read immediately by any other thread that has the privilege to read from that memory location Select one: a. Only options 1 and 4 are true b. Only options 2 and 3 are true c. Only option 5 is true d. Only options 1,3 and 5 are true e. Only options 2, 4 and 5 are true