Consider the ASP programs, B = [0{p}1. 0{q}1.] and H = [:-p,q.] i) Write down the answer sets of B U H (no proof required). For each of the following learning frameworks, either write down examples E+ and E such that (B2, E, E-) forms a task T under that framework and H is an optimal inductive solution of T, or explain why no such examples exist. ii) Brave induction. iii) Cautious induction.