dont use book 'operating system concept '

Please complete the following problems which are from your text book in the following format: After reading each problem provide the answer using at least two sources such as an academic answers in one Word file and submit below journal or a book chapter (not your text bookj. While answer, you must use information from your sources to answer the question. At the end of each answer, provide a conclusion. Put all a process creates a new process using the fork0 operation, which of the following states is shared between the parent process and the child process? Explain why and state which method is most productive. (Explain each one ) Stack -Shared Memory segment 3.8 Describe the difference among short-term, medium-term, and long-term scheduling, Which method would be most efficient with servers? Explain why. 4.16 Linux does not distinguish between processes and threads. Instead, Linux treats both in the same way, allowing a task to be more akin to a processor or a thread depending on the set of flags passed to the clone) system call. However, other operating systems, such as Windows, treat processes and threads differently. Typically, such systems use a notation in which the data structure for a process contains pointers to the separate threads belonging to the process. Contrast these two approaches for modeling processes and threads within the kernel. Discuss which methad would be better for demanding system such as a web server. Backup your argument with published sources. 6.22 Consider a system implementing multilevel queue scheduling. What strategy can a computer user employ to maximize the amount of CPU time allocated to the user's process? Explain your answer and bring sources to back your answer 8.12 Most systems allow a program to allocate more memory to its address space during execution. Allocation of data in the heap segments of programs is and example of such allocated memory. What is required to support dynamic memor allocation in the following schemes? a. Contiguous memory allocation b. Pure segmentation c. Pure paging Explain each of the above schemes and provide sources to back your answers