(25 points) Write down a logical representation for the following sentences as a knowledge base. Let us denote this knowledge base with KBS 3. a. Charlie is a student. b. Son is a professor. c. Al and OOP are the only two available classes. d. Son teaches AI e. Some professor teaches OOP f. Each student must take at least one class. g. Every class has at least one student and must be taught by at least one professor. Use the following predicates in writing the sentences: student(X) (or s(X), for short): X is a student. . professor(X) (or p(X)): X is a professor. class(X) (or c(X)): X is a class. . teaches(X,Y) (or t(X,Y)): X teaches the class Y. . registers(X,Y) (or r(X,Y)): X takes the class Y. . eq(X,Y) (or X-Y): X equals Y. Prove that Charlie takes Al or OOP using resolution. Show the steps