OUESTION #2 (15 minutes)-20 points (4 points for each) (1) How do threads reduce the high context switching overhead in processes? (2) How do threads reduce the high overhead of processes when processes try to share data in shared memory? (3) How is "process deadlock" different from (process) starvation"? 4) What are the four necessary conditions for a process deadlock to occur? (5) Estimate the overhead of inserting (adding) a new block, using the number of the necessary disk accesses, in an existing file using the contiguous, linked-list and index allocation methods for the following cases (please do NOT provide vour solutions on this question Contiguous Linked-List Index 1st sector Nth (NsM) sector Use the following assumptions .The target file consists of M data blocks (Msectors) . Writing/reading a sector each requires the OS one disk acces:s . Each file directory fits to a disk sector. . For the index allocation method, the index fits to a disk sector. For the contiguous allocation method, there are enough empty (unused) disk blocks before and after the target file