See below for how to lock: After being unlocked, only things with higher numbers can be locked again. Any time can be used to open a lock. There are no other locks used. Show how the process doesn't ensure that things will be sent in order.

There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem.

Use the left to right addition method as outlined in the module to add the numbers. For the middle row of answers, if the number above needs an underline, type in an underline (_). Otherwise leave it blank.  Show all work using the correct method on your handwritten work/answer sheet.      9818   + 3871

You have 1000 bottles of soda, and exactly one is poisoned. You have 10 test strips whichcan be used to detect poison. A single drop of poison will turn the test strip positive permanently.You can put any number of drops on a test strip at once and you can reuse a test strip as many timesas you'd like (as long as the results are negative). However, you can only run tests once per day andit takes seven days to return a result. How would you figure out the poisoned bottle in as few daysas possible?Follow up: Write code to simulate your approach

There are four people who want to cross a rickety bridge; they all begin on the same side. You have 17 minutes to get them all across to the other side. It is night, and they have one flashlight. A maximum of two people can cross the bridge at one time. Any party that crosses, either one or two people, must have the flashlight with them. The flashlight must be walked back and forth; it cannot be thrown, for example. Person 1 takes 1 minute to cross the bridge, person 2 takes 2 minutes, person 3 takes 5 minutes, and person 4 takes 10 minutes. A pair must walk together at the rate of the slower person's pace. Write the specification of an algorithm that solves the problem.

Which of those two correct answers is the right answer? The question only allows for one answer to be chosen.