1. Consider the following knowledge base KB Suppose the forward-chaining algorithm, as given in the AIMA textbook Figure 7.15 and the lecture 14 slides, is used to prove KBi E. In Fig. 1, fill out the inferred table, count table, and agenda at each iteration. Fill out the entries at the start of each while loop it before p is popped off the agenda. For the agenda, use a FIFO queue, where items enter on the right and exit on the left. Assume that the inner for-each loop processes clauses in KBi from top to bottom. Note that the inferred and count tables are transposed from what was done in lecture (each column corresponds to an iteration) eration, right 1. Consider the following knowledge base KB Suppose the forward-chaining algorithm, as given in the AIMA textbook Figure 7.15 and the lecture 14 slides, is used to prove KBi E. In Fig. 1, fill out the inferred table, count table, and agenda at each iteration. Fill out the entries at the start of each while loop it before p is popped off the agenda. For the agenda, use a FIFO queue, where items enter on the right and exit on the left. Assume that the inner for-each loop processes clauses in KBi from top to bottom. Note that the inferred and count tables are transposed from what was done in lecture (each column corresponds to an iteration) eration, right