satisfiability answer set(s) of a basic logic program answer set(s) of an arbitrary logic program 1. Let S = {p(c)) and let II be the following logic program: p(a) not p(b). p(b) + not p(c). p(c) not p(a). a. Find the reduct of n with respect to S. b. Is S an answer set of n? Justify your answer. satisfiability answer set(s) of a basic logic program answer set(s) of an arbitrary logic program 1. Let S = {p(c)) and let II be the following logic program: p(a) not p(b). p(b) + not p(c). p(c) not p(a). a. Find the reduct of n with respect to S. b. Is S an answer set of n? Justify your