Question #1 For a rule-based system with the following contents prove the goal: - DATE(Mary,John) using the backward chaining: Draw the complete AND-OR Graph. Rules: 1. (HARLEY(y) A RIDES(x,y)) ROUGH(X) 2. BIKER(x) (HARLEY(y) V BMW(y)) 3. BIKER(x) RIDES(x,y)) 4. (RIDES(x,y) A BMW(y) YUPPIE(x)) 5. YUPPIE(x) LAWYER(x) 6. (NICE(x) A ROUGH(y)) DATE(x,y) 7. (LAWYER(x) A NICE(y)) -- DATE(x,y) Facts: . NICE(Mary) BIKER(John) HARLEY(John)