Consider the expression (peg)A(-pe-). A graph representing this expression will be the graph G = {V, E} where V = (p, p.q, ) and E = ((p,-p), (p.4),(-p, a), (a, -)). Is this expression satisfiable? If it is satisfiable, give a satisfying truth assignment. If it is not satisfiable, explain why it is not. Is its corresponding graph 2-colorable? If it is 2-colorable, give a valid 2-coloring for the graph. If it is not, justify why not.