If you can make an optimal solution for a problem by making optimal solutions for its subproblems, then the problem has the quality in question. a) Subproblems that overlap; b) best substructure; c) memory; d) greedy

Consider a system of three independent, periodic real-time tasks: T1= (4, 3), T2 = (12,7), and T3 = (8, 5). Construct the schedule for these tasks in the interval [0, 24) with q=1 on twoprocessors with PF. Note that there are many PFair algorithms, while PF is one of them. PF prioritize subtasks by deadlines, and break ties by inspecting future subtask deadlines. Also, if a currently-executing job ties with a newly- released job, then continue executing the currently-executing job; break any other ties by task ID (T1 = highest, T3 = lowest). a. Show all sub jobs’ releases and deadlines for (the first job of) each task. Note that q=1 so each sub job should have execution requirement of 1b. Show the PF schedule.c. Will this task set be schedulable with q=2? Please explain.

Suppose Professor Weine described a deterministic algorithm that runs in polynomial time for a known NP-Complete problem such as the Satisfiability problem How would this impact the class NP (the class of problems that can be solved nondeterministically in polynomial time)? 0. The class P would be strictly larger than the class NP 0. The class NP would be equal to the class P O.It would only impact P but not NP O.It would have no impact on the class NP

Explain early problem solving research in AI (including systems like GPS and SOAR).  Explain problem spaces, search in problem spaces, and the Hercules example on the important of representation schemes for problem spaces.