QUESTION 19 Suppose the HORN algorithm is used to determine whether the following propositional logic sentence is satisfiable or not: (p^q1) ^ (WAS T) ^ (T a) ^ (qapar S) After the first step has been executed, we have the following (underlining is used to indicate marking): (p^ 1) ^ (q^S I) ^ (I q) (qapar) Which of the options below gives the situation after the next step has been completed? Option 1: (pag+1) ^ (^S I) ^ (I a) A gapar S) Option 2: (2491) ^ (qAS I) ^ (I a) ^ (QABAr+S) Option 3: (pag1) Agus I) ^ I g) ^ (gARAS) Option 4: (p^g1) Ag ) AI g) ^ (^pars) A