please help with full explanation. thank u

Advanced Topics: Satisfiability (10 pt.) Many problems, in diverse areas such as artificial intelligence and circuit design, can be modeled in terms of propositional satisfiability A compound proposition is satisfiable if there is an assignment of truth values to its variables that makes it true. For example, p ^ q is true when p T and q T; thus, p ^ q is satisfiable When no such assignment exists, the compound proposition is unsatisfiable. (4 pt., 2 pt. each) Answer each of the following questions. a. Explain why if a compound proposition is unsatisfiable, then its negation is a tautology b. Give an example of an unsatisfiable compound proposition with two variables, p and q. 6. Justify your