Correct answer: [A ∧ (A → B)] → B
[A and (A->B)] -> B is the modus-ponens schema and is true under every assignment. A or (A and B) reduces to A and A and (A or B) reduces to A, neither a tautology; B -> [A and (A->B)] fails when B is true and A is false.