5. Recall the 3-coloring problem for Australia from Chapter 6. Encode the problem as a propositional logic problem (that is, the graph is 3-colorable if and only if the corresponding knowledge base is satisfiable). Write out the full encoding as a set of clauses (omit Tasmania). If you also encode the facts that Western Australia is green and Victoria is red, could resolution be used to derive the empty clause? 5. Recall the 3-coloring problem for Australia from Chapter 6. Encode the problem as a propositional logic problem (that is, the graph is 3-colorable if and only if the corresponding knowledge base is satisfiable). Write out the full encoding as a set of clauses (omit Tasmania). If you also encode the facts that Western Australia is green and Victoria is red, could resolution be used to derive the empty clause