3.2 (d) Justify that your algorithm has runtime .

2.3 Prove the correctness of your algorithm given in 2.2.

 4.3 Justify the runtime.

 4.2 Justify that your algorithm is correct.

3.2 Describe a dynamic programming algorithm to find

2.1 Suppose all location numbers are integers in the range . For example: Design an algorithm which tells you which settlements can be built and which cannot be built.

1. Initech Task Planning [10 Points] You finally finished your CS degree and got a job at the banking software company Initech. But you are finding that the real world is not all it’s cracked up to be. You do have a red Swingline stapler, but, on the downside, you have constant TPS reports, a printer that always says “PC LOAD LETTER”, and a large set  of tasks to complete (each task takes the same amount of time to complete). You consider a subset

3.2 (b) Give a Bellman equation that can be used to achieve this.

5.2 (b) Show that MFAN is -hard.

3.2 (e) Describe how to find the solution.