(Solved): Part II (3points): The Short Job First, Round Robin, Priority Scheduling, and the First come First ...

Part II (3points): The Short Job First, Round Robin, Priority Scheduling, and the First come First Serve algorithms are examples of many other algorithms the CPU can use to perform the scheduling functionality. The Shortest Remaining Time and The Multilevel Queue Scheduling are two more scheduling algorithms. For each of these algorithms, do enough search on the internet to address the following points: 1- Discuss, using your own words, the work of the algorithms in steps 2- \( \quad \) Describe the work of the algorithm using at least one example. 3- \( \quad \) The differences between this algorithm and the 4 algorithms we studied in class. You should cite (mention) the online articles/pages/resources/references you used to answer each point you need to use your own words to develop the answer. *Note: You must not copy any resource (text or figure) in your answer, you can should use onlineloffline resources to understand the topic then to develop your own answer. Copied answers will receive Zero. *Note: You can assume that your target reader has no pre-knowledge of these two algorithms, so address the three points above clearly and don't use abbreviations or keywords without explaining them.