You’re in a job interview for the job of your choice. The interviewer asks, “Say we face a new problem X that really needs an optimal solution. You think the problem is NP-complete, but you want to be sure before suggesting to your boss that we settle for a suboptimal heuristic algorithm. What is needed to prove that X is NP-complete?”

When a patient has a pacemaker, it is absolutely contraindicated to utilize heat or ice.

Classify each of the following problems as easy problems (in P) or hard problems (NP-complete).

Outline (high-level is sufficient, but be precise) a simple greedy approach for visiting every house in the neighborhood, starting and ending at your house.

The Physical Therapist Assistant (PTA) reviews the chart of a patient with a 3rd degree burn and notes the physician has requested compression (pressure garments) be obtained. This was MOST likely ordered to assist with:

Which of the following BEST represents consequences of Poly pharmacy?  

Is GR DAG? Justify your answer in terms of the DFS tree you drew.

For the next 6 problems consider the following graph G, and its reverse, GR.

Using the Master Theorem, give the Big-O runtime for this new approach. Show your work.

In the space to the right of the pseudocode (right of the colon), annotate the worst-case Big-O complexity for each step in the algorithm. For lines 2 and 4, indicate as a Big-O complexity the number of times the loops iterate.