Think about correctness (20 points) in class we discussed the interval scheduling problem: given a set i of jobs [s, e], where s is the start time and e > s is the end time, select a subset s of i containing a maximal number of non-overlapping jobs. (if you missed class that day, you can find examples and more discussion of this problem in section 1.2 of the text by skeina, available online through the isu library.) here is a proposed algorithm to solve this problem: start with an empty set s while i is nonempty find the job j such that the midpoint (s e) / 2 is earliest remove j from i remove all jobs from i that overlap j add j to the solution s decide whether the algorithm is correct. if you believe it is correct, give an informal explanation for why it works. if you believe it is incorrect, provide a test case on which it fails (counterexample).

Sarah is having a hard time finding a template for her advertising business that she may be able to use at a later date and also make it available to her colleagues

When a new name is registered on the internet, the process can take two hours to four hours four hours to three days two hours to two days one hour to eight hours

Write a program that lets the user play the game of rock, paper, scissors against the computer. the program should work as follows. 1. when the program begins, a random number in the range of 1 through 3 is generated. if the number is 1, then the computer has chosen rock. if the number is 2, then the computer has chosen paper. if the number is 3, then the computer has chosen scissors. (don’t display the computer’s choice yet.) 2. the user enters his or her choice of “rock”, “paper”, or “scissors” at the keyboard. (you can use a menu if you prefer.) 3. the computer’s choice is displayed. 4. a winner is selected according to the following rules: • if one player chooses rock and the other player chooses scissors, then rock wins. (the rock breaks the scissors.) • if one player chooses scissors and the other player chooses paper, then scissors wins. (scissors cuts paper.) • if one player chooses paper and the other player chooses rock, then paper wins. (paper wraps rock.) • if both players make the same choice, the game must be played again to determine the winner. be sure to divide the program into functions that perform each major task. include the code and the console output from running your program with test inputs in your report.