1. (15 pts] Define the propositional function Q over the domain that consists of all undirected graphs, such that for a graph g=(V,E), Q9) is given by: (VI > 2) A (EV' CV (V' #0 AV{u, v} E E({u, v} V' +0^{u, v} n ( V V ') + 0))). 1. Give a graph 91 that has at least four nodes and at least two edges such that Q(91) is True. Explain your answer. 2. Give a graph 92 that has at least four nodes and at least two edges such that Q (92) is False. Explain your answer. 3. Let gbe a graph with five nodes. What is the smallest value k such that if g has k or more edges, then Q 9) is False, regardless of how the nodes are connected by the edges. Explain your answer. 1. (15 pts] Define the propositional function Q over the domain that consists of all undirected graphs, such that for a graph g=(V,E), Q9) is given by: (VI > 2) A (EV' CV (V' #0 AV{u, v} E E({u, v} V' +0^{u, v} n ( V V ') + 0))). 1. Give a graph 91 that has at least four nodes and at least two edges such that Q(91) is True. Explain your answer. 2. Give a graph 92 that has at least four nodes and at least two edges such that Q (92) is False. Explain your answer. 3. Let gbe a graph with five nodes. What is the smallest value k such that if g has k or more edges, then Q 9) is False, regardless of how the nodes are connected by the edges. Explain your