1 In the SATPLAN algorithm in Figure 22 of the chapter “Logical Agents,” each call to the satisfiability algorithm asserts a goal , where ranges from 0 to . Suppose instead that the satisfiability algorithm is called only once, with the goal g0

∨ g1

∨ · · · ∨ gTmax .

a. Will this always return a plan if one exists with length less than or equal to Tmax?

b. Does this approach introduce any new spurious “solutions”?

c. Discuss how one might modify a satisfiability algorithm such as WALKSAT so that it finds short solutions (if they exist) when given a disjunctive goal of this form.