3. (10 points) For the AND/OR graph below, write the set of Horn clauses that correspond to the graph. The Horn clauses can be written as implications (i.e. A -> B) or as disjunctions (i.e. ~A v B). Then show the steps of the Forward Chaining algorithm as discussed in class for the query E. You do not need to show the marks on the graph - instead show the state of the stack at every step and as you remove each symbol explain which arcs you would mark. For example, when A is removed from the stack you would indicate that the arcs that connect A and E and A and B would both be marked. Note that you should stop once you have derived E - do not continue to derive all of symbols in the graph. G E F B C D 3. (10 points) For the AND/OR graph below, write the set of Horn clauses that correspond to the graph. The Horn clauses can be written as implications (i.e. A -> B) or as disjunctions (i.e. ~A v B). Then show the steps of the Forward Chaining algorithm as discussed in class for the query E. You do not need to show the marks on the graph - instead show the state of the stack at every step and as you remove each symbol explain which arcs you would mark. For example, when A is removed from the stack you would indicate that the arcs that connect A and E and A and B would both be marked. Note that you should stop once you have derived E - do not continue to derive all of symbols in the graph. G E F B C D